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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,395

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

Accessible telephone directories.John B. Goode - 1994 - Journal of Symbolic Logic 59 (1):92-105.
On immortal configurations in turing machines.Emmanuel Jeandel - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 334--343.
On the road to thinking machines: insights and ideas.Jiří Wiedermann - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 733--744.
Ordinal analysis and the infinite ramsey theorem.Bahareh Afshari & Michael Rathjen - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 1--10.
Logics which capture complexity classes over the reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
On P Versus NP for Parameter‐Free Programs Over Algebraic Structures.Armin Hemmerling - 2001 - Mathematical Logic Quarterly 47 (1):67-92.
Infinite games and transfinite recursion of multiple inductive definitions.Keisuke Yoshii & Kazuyuki Tanaka - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 374--383.
Saturation and stability in the theory of computation over the reals.Olivier Chapuis & Pascal Koiran - 1999 - Annals of Pure and Applied Logic 99 (1-3):1-49.
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.
Turing's normal numbers: towards randomness.Verónica Becher - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 35--45.

Analytics

Added to PP
2014-01-28

Downloads
30 (#610,181)

6 months
8 (#830,253)

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