Revision Sequences and Computers with an Infinite Amount of Time

DOI10.1093/logcom/11.1.25zbMath0989.03037OpenAlexW2109974256MaRDI QIDQ2720396

Benedikt Loewe

Publication date: 22 July 2002

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b8b14007b452ba63b4012ada099acdcb054ced11

zbMATH Keywords

Turing machinesdefinabilityrevision theory of truth

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Related Items (10)

On revision operators ⋮ Rethinking revision ⋮ Discrete Transfinite Computation ⋮ Guest editors' introduction ⋮ Supertasks do not increase computational power ⋮ On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS ⋮ Comparing inductive and circular definitions: Parameters, complexity and games

This page was built for publication: Revision Sequences and Computers with an Infinite Amount of Time