Abstract
Typing of information played an historical role in bringing consistency to formulations of set theory and to the foundations of mathematics. Underlying this was the augmentation of language and logical structure with a respect for constructive principles and the corresponding infrastructure of an informational universe. This has important consequences for how we view the computational character of science, the humanities and human creativity. The aim of this article is to make more explicit the anticipations and intuitions of early pioneers such as Alan Turing in informing and making relevant the computability theoretic underpinnings of today’s understanding of this. We hope to make clearer the relationship between the typing of information—a framework basic to all of Turing’s work—and the computability theoretic character of emergent structure in the real universe. The informational terrain arising is one with comprehensive computational structure, but with theoretical boundaries to those areas accessible to effective exploration in an everyday setting.
AMS Classifications: 03D10, 68Q1
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N. Taleb, The Black Swan: The Impact of the Highly Improbable (Allen Lane, London, 2007)
A. Damasio, Descartes’ Error: Emotion, Reason and the Human Brain (G.P. Putnam’s Sons, New York, 1994)
S.B. Cooper, J. van Leeuwen (eds.), Alan Turing: His Work and Impact (Elsevier, Amsterdam, 2013)
S.B. Cooper, Computability Theory (Chapman & Hall/CRC, London, 2004)
H. Putnam, Minds and Machines. Reprinted in Putnam, Mind, Language and Reality. Philosophical Papers, vol. 2, (Cambridge University Press, 1975)
K. Gödel, Russell’s mathematical logic, in The Philosophy of Bertrand Russell, ed. by P.A. Schilpp (Northwestern University, Evanston and Chicago, 1944), pp. 123–153
R.G. Downey, D.R. Hirschfeldt, Algorithmic Randomness and Complexity (Springer, New York, 2010)
C.S. Calude, K. Svozil, Quantum randomness and value indefiniteness. Adv. Sci. Lett. 1(2), 165–168 (2008)
H. Putnam, Realism with a Human Face (Harvard University Press, Cambridge, 1990)
K.V. Mardia, S.B. Cooper, Alan Turing and enigmatic statistics. Bull. Brasilian Section Int. Soc. Bayesian Anal. 5(2), 2–7 (2012)
A.M. Turing, The chemical basis of morphogenesis. Philos. Trans. R. Soc. Lond. Ser, B 237, 37–72 (1952)
A. Tarski, On Definable Sets of Real Numbers; translation of Tarski (1931) by J.H. Woodger. In A. Tarski, Logic, Semantics, Metamathematics, 2nd edn, ed. by J. Corcoran (Hackett, Indianapolis, 1983), pp. 110–142
J. Longley, Notions of computability at higher types I, in Logic Colloquium 2000, ed. by R. Cori, A. Razborov, S. Todorcevic, C. Wood (A K Peters, Natick, 2005)
J. Longley, D. Normann, Computability at Higher Types. Theory and Applications of Computability (Springer, Heidelberg, New York)
A. Hodges, Alan Turing: The Enigma (Vintage, New York, 1992); reprinted in Centennial edition, Princeton University Press, 2012
J. Hadamard, The Psychology of Invention in the Mathematical Field (Princeton University Press, Princeton, 1945)
I. McGilchrist, The Master and His Emissary: The Divided Brain and the Making of the Western World (Yale University Press, New Haven, 2009)
J. Kim, Mind in a Physical World (MIT Press, Cambridge, 1998)
J. Kim, Physicalism, or Something Near Enough (Princeton University Press, Princeton, 2005)
L. Floridi, The Philosophy of Information (Oxford University Press, Oxford, 2011)
S. Pinker, How the Mind Works (W.W. Norton, New York, 1997)
A. Damasio, The Feeling of What Happens: Body and Emotion in the Making of Consciousness (Harcourt Brace, New York, 1999)
G.F.R. Ellis, True complexity and its associated ontology, in Science and Ultimate Reality: Quantum Theory, Cosmology and Complexity, ed. by J.D. Barrow, P.C.W. Davies, C.L. Harper, Jr. (eds.) (Cambridge University Press, Cambridge, 2004)
A.M. Turing, Systems of logic based on ordinals. Proc. London Math. Soc. 45(2), 161–228 (1939); reprinted in Cooper and van Leeuwen, pp. 151–197
H. Rogers, Jr., Some problems of definability in recursive function theory, in Sets, Models and Recursion Theory (Proceedings of Summer School Mathematical Logic and Tenth Logic Colloquium, Leicester, 1965) (North-Holland, Amsterdam, 1967), pp. 183–201
S.B. Cooper, P. Odifreddi, Incomputability in nature, in Computability and Models: Perspectives East and West, ed. by S.B. Cooper, S.S. Goncharov (Plenum, New York, 2003), pp. 137–160
H. Putnam, Why functionalism didn’t work, in Representation and Reality (Putnam, MIT Press, 1988), pp. 73–89
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cooper, S.B. (2015). Incomputability Emergent, and Higher Type Computation. In: Sommaruga, G., Strahm, T. (eds) Turing’s Revolution. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-22156-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-22156-4_13
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-22155-7
Online ISBN: 978-3-319-22156-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)