We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...) historical and conceptual analysis of computability and recursion we make several recommendations in section §7 about preserving the intensional differences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be called "computable" rather than "recursive;" we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be "Computability Theory" or simply Computability rather than "Recursive Function Theory.". (shrink)

An investigation of the concept of “surveyability” as traced through the thought of Hilbert, Wittgenstein, and Turing. The communicability and reproducibility of proof, with certainty, are seen as earmarked by the “surveyability” of symbols, sequences, and structures of proof in all these thinkers. Hilbert initiated the idea within his metamathematics, Wittgenstein took up a kind of game formalism in the 1920s and early 1930s in response. Turing carried Hilbert’s conception of the “surveyability” of proof in metamathematics through into his analysis (...) of what a formal system (what a step in a computation) is in “On computable numbers, with an application to the Entscheidungsproblem” (1936). Wittgenstein’s 1939 investigations of the significance of surveyability to the concept of “proof “in Principia Mathematica were influenced, both by Turing’s remarkable everyday analysis of the Hilbertian idea, and by conversations with Turing. Although Turing does not use the word “surveyability” explicitly, it is clear that the Hilbertian idea plays a recurrent role in his work, refracted through his engagement with Wittgenstein’s idea of a “language-game”. This is evinced in some of his later writings, where the “reform” of mathematical notation for the sake of human surveyability (1944/45) may be seen to draw out the Hilbertian idea. For Turing, as for Wittgenstein, the need for “surveyability” earmarks the evolving culture of humans located in an evolving social and scientific world, just as it had for Hilbert. (shrink)

A. M. Turing has bequeathed us a conceptulary including 'Turing, or Turing-Church, thesis', 'Turing machine', 'universal Turing machine', 'Turing test' and 'Turing structures', plus other unnamed achievements. These include a proof that any formal language adequate to express arithmetic contains undecidable formulas, as well as achievements in computer science, artificial intelligence, mathematics, biology, and cognitive science. Here it is argued that these achievements hang together and have prospered well in the 50 years since Turing's death.

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...) -definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity. (shrink)

Alan Turing is often portrayed as a materialist in secondary literature. In the present article, I suggest that Turing was instead an idealist, inspired by Cambridge scholars, Arthur Eddington, Ernest Hobson, James Jeans and John McTaggart. I outline Turing’s developing thoughts and his legacy in the USA to date. Specifically, I contrast Turing’s two notions of computability (both from 1936) and distinguish between Turing’s “machine intelligence” in the UK and the more well-known “artificial intelligence” in the USA. According to my (...) proposed historical interpretation, Turing did not view computations in the real world to be exhaustively and deterministically characterized by his automatic machines from 1936. (shrink)

Turing was an exceptional mathematician with a peculiar and fascinating personality and yet he remains largely unknown. In fact, he might be considered the father of the von Neumann architecture computer and the pioneer of Artificial Intelligence. And all thanks to his machines; both those that Church called “Turing machines” and the a-, c-, o-, unorganized- and p-machines, which gave rise to evolutionary computations and genetic programming as well as connectionism and learning. This paper looks at all of these and (...) at why he is such an often overlooked and misunderstood figure. (shrink)

Algebraic/topological descriptions of living processes are indispensable to the understanding of both biological and cognitive functions. This paper presents a fundamental algebraic description of living/cognitive processes and exposes its inherent ambiguity. Since ambiguity is forbidden to computation, no computational description can lend insight to inherently ambiguous processes. The impredicativity of these models is not a flaw, but is, rather, their strength. It enables us to reason with ambiguous mathematical representations of ambiguous natural processes. The noncomputability of these structures means computerized (...) simulacra of them are uninformative of their key properties. This leads to the question of how we should reason about them. That question is answered in this paper by presenting an example of such reasoning, the demonstration of a topological strategy for understanding how the fundamental structure can form itself from within itself. (shrink)

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more (...) mathematically concrete challenge to hypercomputability, and will show that one is immediately led into physical impossibilities, thereby demonstrating the infeasibility of hypercomputers more generally. This gives impetus to propose and justify a more plausible starting point for an extension to the classical paradigm that is physically possible, at least in principle. Instead of attempting to rely on infinities such as idealized limits of infinite time or numerical precision, or some other physically unattainable source, one should focus on extending the classical paradigm to better encapsulate modern computational problems that are not well-expressed/modeled by the closed-system paradigm of the Turing machine. I present the first steps toward this goal by considering contemporary computational problems dealing with intractability and issues surrounding cyber-physical systems, and argue that a reasonable extension to the classical paradigm should focus on these issues in order to be practically viable. (shrink)

1936 was a watershed year for computability. Debates among Gödel, Church and others over the correct analysis of the intuitive concept “human effectively computable”, an analysis at the heart of the Incompleteness Theorems, the Entscheidungsproblem, the question of what a finite computation is, and most urgently—for Gödel—the generality of the Incompleteness Theorems, were definitively set to rest with the appearance, in that year, of the Turing Machine. The question I explore here is, do the mathematical facts exhaust what is to (...) be said about the thinking behind the “confluence of ideas in 1936”? I will argue for a cultural role in Gödel’s, and, by extension, the larger logical community’s absorption of Turing’s 1936 model. As scaffolding I employ a conceptual framework due to the critic Leo Marx of the technological sublime; I also make use of the distinction within the technological sublime due to Caroline Jones, between its iconic and performative modes—a distinction operating within the conceptual art of the 1960s, but serving the history of computability equally well. (shrink)