Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.68417OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898835

Martin Ziegler, Klaus Meer

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Turing machines and related notions (03D10)

Related Items

Representation theorems for analytic machines and computability of analytic functions ⋮ A hierarchy below the halting problem for additive machines ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics