Retraceability, Repleteness and Busy Beaver Sets

Robert P. Daley. Retraceability, Repleteness and Busy Beaver Sets. In Jozef Gruska, Michal Chytil, editors, Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings. Volume 118 of Lecture Notes in Computer Science, pages 252-261, Springer, 1981.

Abstract

Abstract is missing.