La Constitution de la Théorie des Automates

A.N.R.T. Université de Lille Iii (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

Colloquium on the Foundations of Mathematics, Mathematical Machines, and Their Applications Colloque Sur les Fondements des Mathématiques, les Machines Mathématques, Et Leurs Applications. Kolloquium Über Die Grundlagen der Mathematik, Mathematische.László Kalmár, Bolyai János Matematikai Társulat & Magyar Tudományos Akadémia - 1965 - Akadémiai Kiadó.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
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.
Turing's World 3.0 for Mac: An Introduction to Computability Theory.Jon Barwise & John Etchemendy - 1993 - Center for the Study of Language and Information Publications.
Undecidability in the imitation game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
Intelligence is not enough: On the socialization of talking machines. [REVIEW]E. Ronald & Moshe Sipper - 2001 - Minds and Machines 11 (4):567-576.
Turing Interrogative Games.Paweł Łupkowski & Andrzej Wiśniewski - 2011 - Minds and Machines 21 (3):435-448.
Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
Can a machine be conscious? How?Stevan Harnad - 2003 - Journal of Consciousness Studies 10 (4-5):67-75.
Is the human mind a Turing machine?D. King - 1996 - Synthese 108 (3):379-89.
[Omnibus Review].John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.

Analytics

Added to PP
2015-02-03

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Jean Mosconi
Centre National de la Recherche Scientifique

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references