Definability by turing machines

Mathematical Logic Quarterly 15 (20-22):325-332 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Definability by turing machines.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (20‐22):325-332.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Turing machines and mental reports.Robert H. Kane - 1966 - Australasian Journal of Philosophy 44 (3):344-52.

Analytics

Added to PP
2016-02-04

Downloads
23 (#682,859)

6 months
1 (#1,472,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Add more references