Computation with Switching Map Systems: Nonlinearity and Computational Complexity
AbstractA 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.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Santa Fe Institute in its series Working Papers with number 01-12-083.
Date of creation: Dec 2001
Date of revision:
Contact details of provider:
Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
Smale's horseshoe; HŽnon map; symbolic dynamics; non-hyperbolicity; computational complexity;
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.