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)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2015.8

Links

PhilArchive



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

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 distribution of ITRM-recognizable reals.Merlin Carl - 2014 - Annals of Pure and Applied Logic 165 (9):1403-1417.
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.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
Self-Embeddings of Computable Trees.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl & Reed Solomon - 2008 - Notre Dame Journal of Formal Logic 49 (1):1-37.
Time of day effects on problem solving: When the non-optimal is optimal.Mareike B. Wieth & Rose T. Zacks - 2011 - Thinking and Reasoning 17 (4):387 - 401.
Hypermachines.Sy-David Friedman & P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):620 - 636.
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.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
On the computational power of random strings.Adam R. Day - 2009 - Annals of Pure and Applied Logic 160 (2):214-228.

Analytics

Added to PP
2016-06-30

Downloads
11 (#1,113,583)

6 months
6 (#512,819)

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