Zur Raumkompliziertheit Mehrdimensionaler Turing‐Automaten

&
Mathematical Logic Quarterly 30 (13-16):233-258 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19840301307

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

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

Zur raumkompliziertheit mehrdimensionaler turing‐automaten.Armin Hemmerling & Gerd Murawski - 1984 - Mathematical Logic Quarterly 30 (13‐16):233-258.
Turing's golden: How well Turing's work stands today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Turing cones and set theory of the reals.Benedikt Löwe - 2001 - Archive for Mathematical Logic 40 (8):651-664.
The Turing test.B. Jack Copeland - 2000 - Minds and Machines 10 (4):519-539.
On Turing's Turing test and why the matter matters.Justin Leiber - 1995 - Synthese 104 (1):59-69.
Turing and the Serendipitous Discovery of the Modern Computer.Aurea Anguera de Sojo, Juan Ares, Juan A. Lara, David Lizcano, María A. Martínez & Juan Pazos - 2013 - Foundations of Science 18 (3):545-557.
On Alan Turing's anticipation of connectionism.Jack Copeland - 1996 - Synthese 108 (3):361-377.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
The Turing paradigm: A critical assessment.Terry L. Rankin - unknown
The annotation game: On Turing (1950) on computing, machinery, and intelligence.Stevan Harnad - 2006 - In Robert Epstein & Grace Peters (eds.), [Book Chapter] (in Press). Kluwer Academic Publishers.
Machines and Thought: The Legacy of Alan Turing, Volume I.Peter Millican & Andy Clark (eds.) - 1996 - Oxford, England: Clarendon Press.
On Alan Turing's Anticipation of Connectionism.Jack Copeland & Diane Proudfoot - 1996 - Synthese 108:361-367.
About Segment Complexity of Turing Reductions.Valeriy K. Bulitko - 1999 - Mathematical Logic Quarterly 45 (4):561-571.
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.

Analytics

Added to PP
2015-12-02

Downloads
18 (#836,359)

6 months
2 (#1,205,524)

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

No references found.

Add more references