Optimal results on recognizability for infinite time register machines

Journal of Symbolic Logic 80 (4):1116-1130 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

External links

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

Through your library

Similar books and articles

The distribution of ITRM-recognizable reals.Merlin Carl - 2014 - Annals of Pure and Applied Logic 165 (9):1403-1417.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Hypermachines.Sy-David Friedman & P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):620 - 636.
Further results on infinite valued predicate logic.L. P. Belluce - 1964 - Journal of Symbolic Logic 29 (2):69-78.
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.

Analytics

Added to PP
2016-06-30

Downloads
20 (#1,050,317)

6 months
6 (#891,985)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Taming Koepke's Zoo II: Register machines.Merlin Carl - 2022 - Annals of Pure and Applied Logic 173 (3):103041.

Add more citations

References found in this work

The distribution of ITRM-recognizable reals.Merlin Carl - 2014 - Annals of Pure and Applied Logic 165 (9):1403-1417.

Add more references