Keyword

Turing computability

Description: A concept in computability theory describing which functions or problems can be computed by a Turing machine.

Primary topic: Computability, Logic, AI Algorithms (69%)

OpenAlex ID: keywords/turing-computability

Shadows of the Mind: A Search for the Missing Science of Consciousness

1994 · Roger Penrose · CERN Document Server (European Organization for Nuclear Research) · 1,061

Recursively enumerable sets of positive integers and their decision problems

1944 · Emil L. Post · Bulletin of the American Mathematical Society · 873

PDF

Computability and Logic

2002 · George S. Boolos, John P. Burgess, et al. · Cambridge University Press eBooks · 823

Computability of Recursive Functions

1963 · J. C. Shepherdson, H. E. Sturgis · Journal of the ACM · 396

Turing computability with neural nets

1991 · Hava T. Siegelmann, Eduardo D. Sontag · Applied Mathematics Letters · 377

Structural organization of nonspecific thalamic nuclei and their projection toward cortex

1967 · Madge E. Scheibel, Arnold B. Scheibel · Brain Research · 368

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

1966 · Calvin C. Elgot, Martin Davis · Mathematics of Computation · 323

Computability and Logic

2007 · George S. Boolos, John P. Burgess, et al. · Cambridge University Press eBooks · 301

Computability and Recursion

1996 · Robert I. Soare · Bulletin of Symbolic Logic · 268

Origins of Recursive Function Theory

1981 · Stephen C. Kleene · IEEE Annals of the History of Computing · 211

Computation, Dynamics, and Cognition

1997 · Marco Giunti · Oxford University Press eBooks · 148

Spiking Neural P Systems With Polarizations

2017 · Tingfang Wu, Andrei Păun, et al. · IEEE Transactions on Neural Networks and Learning Systems · 139

Turing Computability

2016 · Robert I. Soare · Theory and applications of computability · 137

The Myth of Hypercomputation

2004 · Martin Davis · Springer eBooks · 128

A Natural Axiomatization of Computability and Proof of Church's Thesis

2008 · Nachum Dershowitz, Yuri Gurevich · Bulletin of Symbolic Logic · 127

PDF

Membrane Computing and Economics: Numerical P Systems

2006 · Gheorghe Păun, Radu Păun · Fundamenta Informaticae · 120

Remarks before the Princeton bicentennial conference on problems in mathematics (1946)

2001 · Kurt Gudel, Solomon Feferman, et al. · 117

Theories of Computability

1997 · Nicholas Pippenger · Scholarship - Claremont (Claremont Colleges) · 110

Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory

1971 · Harvey Friedman · Studies in logic and the foundations of mathematics · 105

Recursive Function Theory

1962 · Dekker, J. · Proceedings of symposia in pure mathematics · 98

Turing Computations On Ordinals

2005 · Peter Koepke · Bulletin of Symbolic Logic · 96

PDF

Spiking Neural P Systems With Rules on Synapses Working in Maximum Spikes Consumption Strategy

2014 · Tao Song, Linqiang Pan · IEEE Transactions on NanoBioscience · 90

Kolmogorov complexity and the Recursion Theorem

2011 · Bjørn Kjos-Hanssen, Wolfgang Merkle, et al. · Transactions of the American Mathematical Society · 74

PDF

Church's thesis and cognitive science.

1987 · R. J. Nelson · Notre Dame Journal of Formal Logic · 74

Recursion theory

1993 · Joseph R. Schoenfield · 73

Works count: 683

Citation count: 9,248