Computer Studies of Turing Machine Problems
From MaRDI portal
Publication:5509686
DOI10.1145/321264.321270zbMath0137.01002OpenAlexW2068988322WikidataQ56095832 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 (16)
HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION ⋮ Computer Runtimes and the Length of Proofs ⋮ The Complexity of Small Universal Turing Machines: A Survey ⋮ Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮ Castor quadruplorum ⋮ Generating candidate busy beaver machines (or how to build the zany zoo) ⋮ Expository notes on computability and complexity in (arithmetical) games ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ A note on busy beavers and other creatures ⋮ Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness ⋮ Busy beaver competition and Collatz-like problems ⋮ Verifying polymer reaction networks using bisimulation ⋮ Small Turing machines and generalized busy beaver competition ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ Information and computation: Classical and quantum aspects ⋮ TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS
This page was built for publication: Computer Studies of Turing Machine Problems
