Undecidability over Continuous Time

Logic Journal of the IGPL 14 (5):649-658 (2006)

Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit computational power much greater than that of Turing machines . The fact is that they do not have such power. Although they decide the classical halting problem of Turing machines, they otherwise have almost the same limitations of Turing machines
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/jigpal/jzl004
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 48,784
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

[Omnibus Review].Martin Davis - 1990 - Journal of Symbolic Logic 55 (1):342-343.

Add more references

Citations of this work BETA

A Foundation for Real Recursive Function Theory.José Félix Costa, Bruno Loff & Jerzy Mycka - 2009 - Annals of Pure and Applied Logic 160 (3):255-288.
Czego informatycy nauczyli się od Andrzeja Grzegorczyka?Andrzej Salwicki - 2012 - Studies in Logic, Grammar and Rhetoric 27 (40).

Add more citations

Similar books and articles

Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Undecidability in the Imitation Game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Buttresses of the Turing Barrier.Paolo Cotogno - 2015 - Acta Analytica 30 (3):275-282.
Infinite Time Turing Machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Alan Turing and the Mathematical Objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
A Brief Critique of Pure Hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Busy Beaver Competition and Collatz-Like Problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Infinite Time Extensions of Kleene’s $${\Mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.


Added to PP index

Total views
6 ( #1,013,774 of 2,309,235 )

Recent downloads (6 months)
4 ( #268,614 of 2,309,235 )

How can I increase my downloads?


My notes

Sign in to use this feature