Turing is among us

• Published in: Journal of logic and computation Vol. 22; no. 6; pp. 1257 - 1277
• Main Author: Pereira, L. M.
• Format: Journal Article
• Language: English
• Published: 01-12-2012
• Subjects: Algorithms; Automation; Biological; Computation; Proving; Realizability; Symbols; Turing machines
• ISSN: 0955-792X; 1465-363X
• DOI: 10.1093/logcom/exs035

Turing's present-day and all-time relevance arises from the timelessness of the issues he tackled, and the innovative light he shed upon them. Turing first defined the algorithmic limits of computability, when determined via effective mechanism, and showed the generality of his definition by proving its equivalence to other general, but less algorithmic, non-mechanical, more abstract formulations of computability. In truth, his originality much impressed Godel, for the simplicity of the mechanism invoked-what we nowadays call a Turing Machine (or program)-and for the proof of existence of a Universal Turing Machine (what we call digital computer)-which can demonstrably mimic any other Turing Machine, i.e. execute any program. Indeed, Turing Machines simply rely on having a finite-state automaton (like a vending machine), and an unbound paper tape made of discrete squares (like a paper roll), with at most one rewritable symbol on each square. Turing also first implicitly introduced the perspective of 'functionalism'-though he did not use the word, it was introduced later by Putnam, inspired by Turing's work-by showing that what counts is the realizability of functions, independently of the hardware that embodies them. And that realizability is afforded by the very simplicity of his devised mechanism, what he then called A-machines (but now bear his name), which rely solely on the manipulation of symbols-as discrete as the fingers of one hand-wherein both data and instructions are represented with symbols, both being subject to manipulation. The twain, data as well as instructions, are stored in memory, where instructions double as data and as rules for acting-the stored program idea. No one to this day has invented a computational mechanical process with such general properties, which cannot be theoretically approximated with arbitrary precision by some Turing Machine, wherein interactions are to be captured by Turing's innovative concept of oracle. In these days of discrete-time quantization, computational biological processes, and proof of ever expanding universe-the automata and the tape-the Turing Machine reigns supreme. Moreover, universal functionalism-another Turing essence-is what enables the inevitable bringing together of the ghosts in the several embodied machines (silicon-based, biological, extra-terrestrial or otherwise) to promote their symbiotic epistemic co-evolution, since they partake of the same theoretic functionalism. Turing is truly and forever among us.