Computability

Results: 1315



#Item
991Erkenn DOI[removed]s10670[removed]x ORIGINAL PAPER Ideal Negative Conceivability and the Halting Problem Manolo Martı´nez

Erkenn DOI[removed]s10670[removed]x ORIGINAL PAPER Ideal Negative Conceivability and the Halting Problem Manolo Martı´nez

Add to Reading List

Source URL: www.astrud.com

Language: English - Date: 2012-04-19 10:38:57
992Informatica special issue on 100 YEARS OF ALAN TURING AND 20 YEARS OF SLAIS Alan Mathison Turing (1912–1954) was an English mathematician, logician, cryptanalyst, and computer scientist. He was highly influential in t

Informatica special issue on 100 YEARS OF ALAN TURING AND 20 YEARS OF SLAIS Alan Mathison Turing (1912–1954) was an English mathematician, logician, cryptanalyst, and computer scientist. He was highly influential in t

Add to Reading List

Source URL: www.informatica.si

Language: English - Date: 2012-10-25 10:36:31
993The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

Add to Reading List

Source URL: www.cs.unibo.it

Language: English - Date: 2007-10-31 03:46:45
994Australasian Journal of Philosophy Vol. 85, No. 1, pp. 93 – 115; March 2007 COMPUTATIONAL MODELLING VS. COMPUTATIONAL EXPLANATION: IS EVERYTHING A TURING MACHINE, AND

Australasian Journal of Philosophy Vol. 85, No. 1, pp. 93 – 115; March 2007 COMPUTATIONAL MODELLING VS. COMPUTATIONAL EXPLANATION: IS EVERYTHING A TURING MACHINE, AND

Add to Reading List

Source URL: www.umsl.edu

Language: English - Date: 2007-03-29 09:12:42
995Chapter 9 Rewriting Nachum Dershowitz David A. Plaisted

Chapter 9 Rewriting Nachum Dershowitz David A. Plaisted

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2005-03-20 12:18:38
996The Dierential Lambda-Calculus Thomas Ehrhard and Laurent Regnier Institut de Mathématiques de Luminy, C.N.R.S. U.P.R[removed]removed]

The Dierential Lambda-Calculus Thomas Ehrhard and Laurent Regnier Institut de Mathématiques de Luminy, C.N.R.S. U.P.R[removed]removed]

Add to Reading List

Source URL: iml.univ-mrs.fr

Language: English - Date: 2001-05-31 09:45:10
997PHYSICS, PHILOSOPHY AND QUANTUM TECHNOLOGY DAVID DEUTSCH Oxford University, Oxford, United Kingdom E-mail: [removed] Quantum theory and the classical theory of computation were perfected

PHYSICS, PHILOSOPHY AND QUANTUM TECHNOLOGY DAVID DEUTSCH Oxford University, Oxford, United Kingdom E-mail: [removed] Quantum theory and the classical theory of computation were perfected

Add to Reading List

Source URL: ricardo.ecn.wfu.edu

Language: English - Date: 2003-06-02 00:00:01
998Quantifying Morphological Computation Keyan Zahedi Nihat Ay SFI WORKING PAPER: [removed]

Quantifying Morphological Computation Keyan Zahedi Nihat Ay SFI WORKING PAPER: [removed]

Add to Reading List

Source URL: www.santafe.edu

Language: English - Date: 2013-03-06 12:51:44
999Π01 CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV, DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., TIMOTHY MCNICHOLL, AND SARAH PINGREY Abstract. We study the weak tru

Π01 CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV, DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., TIMOTHY MCNICHOLL, AND SARAH PINGREY Abstract. We study the weak tru

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:57:30
1000GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl

GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2013-02-15 20:06:55