### Citations

1018 | Theory of Recursive Functions and Effective Computability - Rogers - 1967 |

925 | 1952]: Introduction to Metamathematics - Kleene |

436 | Evolving algebras 1993: Lipari guide
- Gurevich
- 1995
(Show Context)
Citation Context ...orithm. 5 Effectiveness Having axiomatized algorithmic processes, we turn to the question of how to describe them by finite means. 5.1 Algorithms Gurevich [23] showed that his abstract state machines =-=[22]-=-, constitute a most general model of computation, one that can precisely describe effective transitions of any classical algorithm, on any desired level of abstraction of data structures and native op... |

370 | An unsolvable problem of elementary number theory - Church - 1936 |

228 |
Shadows of the Mind: A Search for the Missing Science of Consciousness
- Penrose
- 1994
(Show Context)
Citation Context ...s from all the above that any model purporting to be hypercomputational model, that computes all the Turing-computable functions and then some, be they (idealized) humans (as claimed, for example, in =-=[39, 41, 6]-=-), theoretical contrivance (e.g. [20, 43, 7]), or hypothetical (or idealized) physical apparatus (as proposed, for instance, in [15, 28, 54]), must violate one of our postulates. Note that, to be trul... |

130 | Sequential Abstract State Machines capture Sequential Algorithms
- Gurevich
- 2000
(Show Context)
Citation Context .... Likewise, processes in which states evolve continuously (as in analog processes, like the position of a bouncing ball), rather than discretely, are eschewed. Yuri Gurevich’s “sequential postulates” =-=[23]-=- characterize algorithmicity in its classical sense. They assert that states are first-order structures and that transitions respect isomorphisms (see Section 3). An algorithm provides a prescription ... |

126 |
Limiting recursion
- Gold
- 1965
(Show Context)
Citation Context ...e nondeterministic choice, probabilistic choice, or interaction with the environment, one would need to modify the above notion of transition. 5This postulate is meant to exclude formalisms, such as =-=[20, 43]-=-, in which the result of a computation—or the continuation of a computation—may depend on (the limit of) an infinite sequence of preceding (finite or infinitesimal) steps. Likewise, processes in which... |

121 |
Trial and error predicates and the solution of a problem of Mostowski
- Putnam
- 1965
(Show Context)
Citation Context ...e nondeterministic choice, probabilistic choice, or interaction with the environment, one would need to modify the above notion of transition. 5This postulate is meant to exclude formalisms, such as =-=[20, 43]-=-, in which the result of a computation—or the continuation of a computation—may depend on (the limit of) an infinite sequence of preceding (finite or infinitesimal) steps. Likewise, processes in which... |

109 | Grundzüge der theoretischen Logik - Hilbert, Ackermann - 1937 |

90 |
Church’s thesis and principles for mechanisms
- Gandy
- 1980
(Show Context)
Citation Context ...and functions, thus providing a dramatic ‘proof’ of Church’s Thesis.” We discuss such an axiomatization of effectiveness in Sections 2–5. Unlike Turing’s analysis [56], and subsequent generalizations =-=[37, 38, 18, 49, 52, 50, 53]-=-, our axioms of effective computation are, at the same time, both formal and generic. They are formal, in that they may be cast as precise mathematical statements [4, 14]; they are generic, in that th... |

83 | Mathematical Logic - Kleene - 1967 |

81 |
Computable algebra, general theory and theory of computable fields
- Rabin
- 1960
(Show Context)
Citation Context ...he same oracle. And a model is relatively computable if all its algorithms are, via the same encoding and same oracle. Sans oracles, we call it computable. This is akin to a computable algebra, as in =-=[17, 40, 44, 55]-=-, but we are not placing restrictions on the injective encoding. Were we not to require the encoding to be an injection, we could trivially simulate everything by encoding everything by a single const... |

63 | λ-definability and recursiveness - Kleene - 1936 |

44 | Absolutely unsolvable problems and relatively undecidable propositions - Post - 1965 |

40 | A natural axiomatization of computability and proof of Church’s Thesis
- Dershowitz, Gurevich
(Show Context)
Citation Context ...izations [37, 38, 18, 49, 52, 50, 53], our axioms of effective computation are, at the same time, both formal and generic. They are formal, in that they may be cast as precise mathematical statements =-=[4, 14]-=-; they are generic, in that they apply to computations with arbitrary states (Section 3) and arbitrary programmable transitions (Section 4). Computability is a more general notion than recursiveness o... |

38 | On Folk Theorems - Harel - 1980 |

31 |
The myth of hypercomputation
- Davis
- 2004
(Show Context)
Citation Context ...ng’s analysis of “the sorts of operations which a human computer could perform, working according to preassigned instructions” showed that these can be simulated by Turing machines. Gödel is reported =-=[12]-=- to have believed “that it might be possible . . . to state a set of axioms which would embody the generally accepted properties of [effective calculability], and to do something on that basis”. As ex... |

29 | What is an algorithm
- Moschovakis
- 2001
(Show Context)
Citation Context ...ess stored in the current state. State-transitions are deterministic. Classical algorithms in fact never leave room for choices, nor do they involve any sort of interaction with the 3 An exception is =-=[41]-=-, which argues that algorithms should be equated with recursive definitions. 5environment to determine the next step. To incorporate nondeterministic choice, probabilistic choice, or interaction with... |

27 |
Mathematische Probleme: Vortrag, gehalten auf dem internationalen MathematikerCongress zu Paris 1900 [Mathematical problems
- Hilbert
- 1900
(Show Context)
Citation Context ...er 1 Introduction In 1900, David Hilbert posed, among other problems, the research challenge of how to effectively determine whether any given polynomial with rational coefficients has rational roots =-=[25]-=-: 1 [Probleme] 10. Entscheidung der Lösbarkeit einer Diophantischen Gleichung. Eine Diophantische Gleichung mit irgend welchen Unbekannten und mit ganzen rationalen Zahlencoefficienten sei vorgelegt: ... |

26 |
Mathematics and computer science: Coping with finiteness,” Science 194
- Knuth
- 1976
(Show Context)
Citation Context ...bularies are finite, since an algorithm must be describable in finite terms, so can only refer explicitly to finitely many operations. Hence, an algorithm cannot, for instance, involve all of Knuth’s =-=[36]-=- arrow operations, ↑, ↑↑, ↑↑↑, etc. Instead one could employ a ternary operation λxyz. x ↑z y. In restricting structures to be “first-order”, we are limiting the syntax to be first-order. This preclud... |

19 |
2003): On Gurevich’s Theorem on Sequential Algorithms
- Reisig
(Show Context)
Citation Context ...or of [21] wrote, “applicable to any continuous function” f over the reals—including ones that are not programmable. This program cannot be considered effective; indeed its domain is uncountable. See =-=[45]-=- for examples of geometric constructions with compass and straightedge. 5.2 Effective Algorithms The sequential postulates limit transitions to be effective, in the sense of being amenable to finite d... |

17 | Recursion Theory - Shoenfield - 1991 |

15 | The Church-Turing thesis over arbitrary domains
- Boker, Dershowitz
- 2008
(Show Context)
Citation Context ...izations [37, 38, 18, 49, 52, 50, 53], our axioms of effective computation are, at the same time, both formal and generic. They are formal, in that they may be cast as precise mathematical statements =-=[4, 14]-=-; they are generic, in that they apply to computations with arbitrary states (Section 3) and arbitrary programmable transitions (Section 4). Computability is a more general notion than recursiveness o... |

14 | Turing’s analysis of computability, and major applications of it - Kleene - 1988 |

10 | Reflections on Church’s thesis. Notre Dame - Kleene - 1987 |

9 | The prospects for mathematical logic in the twenty-first century. The Bulletin of Symbolic Logic 7
- Buss, Kechris, et al.
- 2001
(Show Context)
Citation Context ...ugh some interesting partial results have been obtained). This challenge of proving the Church-Turing Thesis is first in Richard Shore’s list of “pie-in-the-sky problems” for the twenty-first century =-=[8]-=-. Indeed, Harvey Friedman [16] has predicted that sometime in this century, “There will be an unexpected striking discovery that any model of computation satisfying certain remarkably weak conditions ... |

8 |
The computable kernel of abstract state machines. Theoretical Computer Science 409
- Reisig
- 2008
(Show Context)
Citation Context ... states with the same constructors and oracles. One can give an alternate characterization of effective state, one that is based on oracular Turing machines, extending a suggestion of Wolfgang Reisig =-=[46]-=-. Lemma A state X is effective relative to a set of oracles if and only if there is a Turing machine with the same oracles that can semi-decide the congruence induced by X. In other words, given two t... |

7 | Y.: Exact exploration and hanging algorithms
- Blass, Dershowitz
- 2010
(Show Context)
Citation Context ...the algorithm. It follows that an algorithm should work equally well in isomorphic worlds. Compare [18, p. 128]. In this sense states are “abstract”. These considerations lead to the second postulate =-=[23, 1]-=-: Postulate (State) States of an algorithm are (first-order) structures over a finite vocabulary, closed under isomorphism of domains, such that initial states and terminal states are also closed unde... |

6 | N.: Three paths to effectiveness
- Boker, Dershowitz
- 2010
(Show Context)
Citation Context ... by X, false when both are defined but not equal, and diverges otherwise. Input and output for the machines’s oracles is via constructor terms. The proof is along the lines of the non-oracular one in =-=[5]-=-. 4 Transitions For a process, effective or not, to be deemed algorithmic, it must be possible to express the transition rules for going from state to state in some finite fashion. Kleene stressed thi... |

5 | A new Gödelian argument for hypercomputing minds based on the busy beaver problem
- Bringsjord, Kellett, et al.
(Show Context)
Citation Context ...s from all the above that any model purporting to be hypercomputational model, that computes all the Turing-computable functions and then some, be they (idealized) humans (as claimed, for example, in =-=[39, 41, 6]-=-), theoretical contrivance (e.g. [20, 43, 7]), or hypothetical (or idealized) physical apparatus (as proposed, for instance, in [15, 28, 54]), must violate one of our postulates. Note that, to be trul... |

5 |
Algorithm and program; information and data
- Knuth
- 1966
(Show Context)
Citation Context ...wers. See Sections 3.3 and 5.3. We draw some conclusions in the final section. 2 Discrete Algorithms By an algorithm, one invariably means some type of state-transition system. As Donald Knuth writes =-=[35]-=-, for example: Algorithms are concepts which have existence apart from any programming language. . . . I believe algorithms were present long before Turing et al. formulated them, just as the concept ... |

4 |
Effective procedures in field theory, Philosophical Transactions of the Royal Society of London
- Fröhlich, Shepherdson
- 1956
(Show Context)
Citation Context ...he same oracle. And a model is relatively computable if all its algorithms are, via the same encoding and same oracle. Sans oracles, we call it computable. This is akin to a computable algebra, as in =-=[17, 40, 44, 55]-=-, but we are not placing restrictions on the injective encoding. Were we not to require the encoding to be an injection, we could trivially simulate everything by encoding everything by a single const... |

4 |
O ponyatii algoritma [On the concept of algorithm], Uspekhi Matematicheskikh Nauk [Russian Mathematical Surveys
- Kolmogorov
- 1953
(Show Context)
Citation Context ...and functions, thus providing a dramatic ‘proof’ of Church’s Thesis.” We discuss such an axiomatization of effectiveness in Sections 2–5. Unlike Turing’s analysis [56], and subsequent generalizations =-=[37, 38, 18, 49, 52, 50, 53]-=-, our axioms of effective computation are, at the same time, both formal and generic. They are formal, in that they may be cast as precise mathematical statements [4, 14]; they are generic, in that th... |

3 |
Super-Recursive Algorithms (Monographs
- Burgin
- 2004
(Show Context)
Citation Context ...ng to be hypercomputational model, that computes all the Turing-computable functions and then some, be they (idealized) humans (as claimed, for example, in [39, 41, 6]), theoretical contrivance (e.g. =-=[20, 43, 7]-=-), or hypothetical (or idealized) physical apparatus (as proposed, for instance, in [15, 28, 54]), must violate one of our postulates. Note that, to be truly hypercomputational, it is crucial that a m... |

3 |
Algorithms: Bisection Routine
- Gorn
- 1960
(Show Context)
Citation Context ...ondition is true. This program describes the standard bisection search for the root of a function, as described in [21, Algorithm #4]. The point is that this abstract formulation is, as the author of =-=[21]-=- wrote, “applicable to any continuous function” f over the reals—including ones that are not programmable. This program cannot be considered effective; indeed its domain is uncountable. See [45] for e... |

3 |
review of Judson C. Webb, Mechanism, Mentalism and Metamathematics: An Essay on Finitism (D
- Lucas
- 1980
(Show Context)
Citation Context ...s from all the above that any model purporting to be hypercomputational model, that computes all the Turing-computable functions and then some, be they (idealized) humans (as claimed, for example, in =-=[39, 41, 6]-=-), theoretical contrivance (e.g. [20, 43, 7]), or hypothetical (or idealized) physical apparatus (as proposed, for instance, in [15, 28, 54]), must violate one of our postulates. Note that, to be trul... |

2 |
Mathematical logic in the 20th and 21st centuries. FOM mailing list
- Friedman
- 2000
(Show Context)
Citation Context ...results have been obtained). This challenge of proving the Church-Turing Thesis is first in Richard Shore’s list of “pie-in-the-sky problems” for the twenty-first century [8]. Indeed, Harvey Friedman =-=[16]-=- has predicted that sometime in this century, “There will be an unexpected striking discovery that any model of computation satisfying certain remarkably weak conditions must stay within the recursive... |

2 |
Konstruktivnyye algyebry. 1, Uspekhi Matematicheskikh Nauk
- Mal’cev
- 1961
(Show Context)
Citation Context ...he same oracle. And a model is relatively computable if all its algorithms are, via the same encoding and same oracle. Sans oracles, we call it computable. This is akin to a computable algebra, as in =-=[17, 40, 44, 55]-=-, but we are not placing restrictions on the injective encoding. Were we not to require the encoding to be an injection, we could trivially simulate everything by encoding everything by a single const... |

1 |
Comparing computational power. Logic Journal of the IGPL 14(5):633–648, 2006. doi:10.1007/ 978-3-540-78127-1. Cf. [11, p. 1]: “Hypercomputation is the computation of functions or numbers that cannot be computed
- Boker, Dershowitz
(Show Context)
Citation Context ... is an injective encoding ρ of E into D such that for every partial function g of B there is a partial function f of A, such that g = ρ−1 ◦ f ◦ ρ. A detailed discussion of simulations may be found in =-=[2]-=-. So, a state X over vocabulary F and arbitrary domain D is computable over oracles O if there is an encoding of D into the naturals and a recursive structure Y with domain N over oracles ρ ◦ o ◦ ρ−1 ... |

1 | 21 Tien D. Kieu. Quantum algorithm for Hilbert’s Tenth Problem - Kelley, Topology, et al. - 1955 |

1 | Recursive predicates and quantifiers, Transactions of the American - Kleene - 1943 |