Fundamentals of Computation Theory
From MaRDI portal
Publication:5492951
DOI10.1007/11537311zbMath1123.03033OpenAlexW2491671784MaRDI QIDQ5492951
Martin Ziegler, Sven Köhler, Christian Schindelhauer
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Decidability of theories and sets of sentences (03B25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Turing machines and related notions (03D10)
Related Items (4)
What Percentage of Programs Halt? ⋮ Computable model discovery and high-level-programming approximations to algorithmic complexity ⋮ Superintelligence Cannot be Contained: Lessons from Computability Theory ⋮ Most programs stop quickly or never halt
This page was built for publication: Fundamentals of Computation Theory
