Towards a theory of infinite time Blum-Shub-Smale machines

In S. Barry Cooper (ed.), How the World Computes. pp. 405--415 (2012)

Abstract

This article has no associated abstract. (fix it)

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,855

External links

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

Through your library

Analytics

Added to PP
2014-01-28

Downloads
20 (#563,625)

6 months
1 (#386,001)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Citations of this work

The Computational Strengths of Α-Tape Infinite Time Turing Machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.

Add more citations

Similar books and articles

Accessible Telephone Directories.John B. Goode - 1994 - Journal of Symbolic Logic 59 (1):92-105.
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.
Logics Which Capture Complexity Classes Over the Reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
Hypermachines.Sy-David Friedman & P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):620 - 636.
Logically Possible Machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
Ordinal Machines and Admissible Recursion Theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Supermachines and Superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.