Computation with Switching Map Systems: Nonlinearity and Computational Complexity

Yuzuru Sato, Makoto Taiji and Takashi Ikegami

Working Papers from Santa Fe Institute

Abstract: A dynamical-systems-based model of computation is studied. We demonstrate the computational ability of nonlinear mappings. There exists a switching map system with two types of baker's map to emulate any Turing machine. Taking non-hyperbolic mappings with second-order nonlinearity (e.g., the HŽnon map) as elementary operations, the switching map system becomes an effective analog computer executing parallel computation similar to MRAM. Our results show that, with an integer division map similar to the Gauss map, it has PSPACE computational power. Without this, we conjecture that its computational power is between class RP and PSPACE. Unstable computation with this system implies that there would be a trade-off principle between stability of computation and computational power.

Keywords: Smale's horseshoe; HŽnon map; symbolic dynamics; non-hyperbolicity; computational complexity (search for similar items in EconPapers)
Date: 2001-12
New Economics Papers: this item is included in nep-ifn
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:wop:safiwp:01-12-083

Access Statistics for this paper

More papers in Working Papers from Santa Fe Institute Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().