Is Being Computational an Intrinsic Property of a Dynamical System?

Marco Giunti
Additional contact information
Marco Giunti: Università di Cagliari

A chapter in Systemics of Emergence: Research and Development, 2006, pp 683-694 from Springer

Abstract: Abstract I consider whether or not a discrete dynamical system has two isomorphic representations, one recursive and the other non-recursive; if it does not, the system can be said to be an intrinsic computational system. I prove that intrinsic computational systems exist, as well as non-intrinsic ones, and I finally argue that some representation of a non-intrinsic computational system is not effective with respect to the state-space structure of the system.

Keywords: dynamical systems theory; discrete system; computational system; computation; computability theory; recursive function; effective procedure; representability (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-28898-7_48

Ordering information: This item can be ordered from
http://www.springer.com/9780387288987

DOI: 10.1007/0-387-28898-8_48

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().