Taming Koepke's Zoo II: Register machines

Annals of Pure and Applied Logic 173 (3):103041 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2021.103041

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The basic theory of infinite time register machines.Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi & Gregor Weckbecker - 2010 - Archive for Mathematical Logic 49 (2):249-273.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
Post’s Problem for ordinal register machines: An explicit approach.Joel David Hamkins & Russell G. Miller - 2009 - Annals of Pure and Applied Logic 160 (3):302-309.
Ordinal Computability: An Introduction to Infinitary Machines.Merlin Carl - 2019 - Boston: De Gruyter.
Optimal results on recognizability for infinite time register machines.Merlin Carl - 2015 - Journal of Symbolic Logic 80 (4):1116-1130.
Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Towards a theory of infinite time Blum-Shub-Smale machines.Peter Koepke & Benjamin Seyfferth - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 405--415.
Review: Hans-Dieter Donder, Peter Koepke, On the Consistency Strength of `Accessible' Jonsson Cardinals and of the Weak Chang Conjecture; Peter Koepke, Some Applications of Short Core Models. [REVIEW]Sy D. Friedman - 1989 - Journal of Symbolic Logic 54 (4):1496-1497.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Hyperfine Structure Theory and Gap 1 Morasses.Sy-David Friedman, Peter Koepke & Boris Piwinger - 2006 - Journal of Symbolic Logic 71 (2):480 - 490.
On Unlimited Register Machines.R. J. Baxter - 1972 - Mathematical Logic Quarterly 18 (7):97-102.
On Unlimited Register Machines.R. J. Baxter - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (7):97-102.
Hans-Dieter Donder and Peter Koepke. On the consistency strength of ‘accessible’ Jonsson cardinals and of the weak Chang conjecture. Annals of pure and applied logic, vol. 25 , pp. 233–261. - Peter Koepke. Some applications of short core models. Annals of pure and applied logic, vol. 37 , pp. 179–204. [REVIEW]Sy D. Friedman - 1989 - Journal of Symbolic Logic 54 (4):1496-1497.
The distribution of ITRM-recognizable reals.Merlin Carl - 2014 - Annals of Pure and Applied Logic 165 (9):1403-1417.
John Register.Barnaby Conrad - 1989 - Chronicle Books (CA).

Analytics

Added to PP
2021-09-19

Downloads
28 (#566,590)

6 months
8 (#351,446)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

What is the theory without power set?Victoria Gitman, Joel David Hamkins & Thomas A. Johnstone - 2016 - Mathematical Logic Quarterly 62 (4-5):391-406.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.

View all 10 references / Add more references