The machine as data: a computational view of emergence and definability

Synthese 192 (7):1955-1988 (2015)
Turing’s paper on computable numbers has played its role in underpinning different perspectives on the world of information. On the one hand, it encourages a digital ontology, with a perceived flatness of computational structure comprehensively hosting causality at the physical level and beyond. On the other, it can give an insight into the way in which higher order information arises and leads to loss of computational control—while demonstrating how the control can be re-established, in special circumstances, via suitable type reductions. We examine the classical computational framework more closely than is usual, drawing out lessons for the wider application of information–theoretical approaches to characterizing the real world. The problem which arises across a range of contexts is the characterizing of the balance of power between the complexity of informational structure and the means available to bring this information back into the computational fold. We proceed via appropriate mathematical modelling to a more coherent view of the computational structure of information, relevant to a wide spectrum of areas of investigation
Keywords Higher order computation  Turing definability  Emergence  Embodiment  Incomputability  Universality
Categories (categorize this paper)
DOI 10.1007/s11229-015-0803-4
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 38,086
Through your library

References found in this work BETA

Physicalism, or Something Near Enough.Jaegwon Kim - 2005 - Princeton University Press.
The Philosophy of Information.Luciano Floridi - 2011 - Oxford University Press.
On the Proper Treatment of Connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.

View all 19 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Neural and Super-Turing Computing.Hava T. Siegelmann - 2003 - Minds and Machines 13 (1):103-114.
Concrete Digital Computation: What Does It Take for a Physical System to Compute? [REVIEW]Nir Fresco - 2011 - Journal of Logic, Language and Information 20 (4):513-537.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Computation Models for Parameterized Complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.


Added to PP index

Total views
18 ( #365,564 of 2,313,437 )

Recent downloads (6 months)
5 ( #161,796 of 2,313,437 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature