 Incomputability Emergent, and Higher Type ComputationA chapter in Turing’s Revolution, 2015, pp 311-329 from Springer Abstract: 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. Keywords: Emergence; Higher type computation; Incomputability; Turing definability (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-22156-4_13 Ordering information: This item can be ordered from DOI: 10.1007/978-3-319-22156-4_13 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.