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

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

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

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

358 PG. Hinman.J. Barwise, L. Blum, M. Shub, S. Smale, Fr Drake, Ss Wainer, E. Engeler, Hm Friedman, Ro Gandy & Cme Yates - 1999 - In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 358.
On P Versus NP for Parameter‐Free Programs Over Algebraic Structures.Armin Hemmerling - 2001 - Mathematical Logic Quarterly 47 (1):67-92.
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.
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 & 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.
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.
About and Around Computing Over the Reals.Solomon Feferman - unknown
Le problème Des granDes puissances et celui Des granDes racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
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.

Analytics

Added to PP
2014-01-28

Downloads
25 (#629,577)

6 months
4 (#775,606)

Historical graph of downloads
How can I increase my downloads?

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

References found in this work

No references found.

Add more references