Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMATH Open1136.03322DBLPconf/cie/2006OpenAlexW4255986326MaRDI QIDQ5898853

Author name not available (Why is that?)

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

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (3)

Halting time is predictable for large models: a universality property and average-case analysis ⋮ Bounding lemmata for non-deterministic halting times of transfinite Turing machines ⋮ Weaker variants of infinite time Turing machines

Recommendations

• Asymptotic behavior and halting probability of Turing machines 👍 👎
• On the generic undecidability of the halting problem for normalized Turing machines 👍 👎
• Bounding lemmata for non-deterministic halting times of transfinite Turing machines 👍 👎
• Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility 👍 👎
• Non-erasing turing machines: A new frontier between a decidable halting problem and universality 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Logical Approaches to Computational Barriers

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