Computer Studies of Turing Machine Problems
From MaRDI portal
Publication:5509686
DOI10.1145/321264.321270zbMath0137.01002WikidataQ56095832 ScholiaQ56095832MaRDI QIDQ5509686
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486554418657614
Related Items
A note on busy beavers and other creatures, On the complex behavior of simple tag systems -- an experimental approach, Busy beaver competition and Collatz-like problems, Small Turing machines and generalized busy beaver competition, Castor quadruplorum, Expository notes on computability and complexity in (arithmetical) games, A new Gödelian argument for hypercomputing minds based on the busy beaver problem, Computer Runtimes and the Length of Proofs, The Complexity of Small Universal Turing Machines: A Survey, Information and computation: Classical and quantum aspects, HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION