Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1143.03357OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898823

Peter Koepke

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)

Related Items

RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ An Enhanced Theory of Infinite Time Register Machines ⋮ Recognizable sets and Woodin cardinals: computation beyond the constructible universe ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ The distribution of ITRM-recognizable reals ⋮ The basic theory of infinite time register machines ⋮ Taming Koepke's zoo. II: Register machines ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines