Computer Studies of Turing Machine Problems

DOI10.1145/321264.321270MaRDI QIDQ5509686zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shen Lin, Tibor Radó

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

zbMATH Keywords

mathematical logic

Cited in

(16)

• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
• Castor quadruplorum
• Verifying polymer reaction networks using bisimulation
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• Homology of groups and third busy beaver function
• A note on busy beavers and other creatures
• Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
• Computer runtimes and the length of proofs. With an algorithmic probabilistic application to waiting times in automatic theorem proving
• Busy beaver competition and Collatz-like problems
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• On the complex behavior of simple tag systems -- an experimental approach
• Small Turing machines and generalized busy beaver competition
• The Complexity of Small Universal Turing Machines: A Survey
• Generating candidate busy beaver machines (or how to build the zany zoo)
• Expository notes on computability and complexity in (arithmetical) games
• Information and computation: Classical and quantum aspects

This page was built for publication: Computer Studies of Turing Machine Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5509686)