Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3971350
Jump to:navigation, search

zbMath0744.68043MaRDI QIDQ3971350

Jürgen Buntrock, Heiner Marxen

Publication date: 25 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Turing machinesbusy beaver game


Mathematics Subject Classification ID

Turing machines and related notions (03D10)


Related Items (9)

The Complexity of Small Universal Turing Machines: A Survey ⋮ Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮ Generating candidate busy beaver machines (or how to build the zany zoo) ⋮ 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 ⋮ Small Turing machines and generalized busy beaver competition ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ Naturalness in Mathematics






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3971350&oldid=11998884"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki