This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Computation with Switching Map Systems: Nonlinearity and Computational Complexity

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Yuzuru Sato
Makoto Taiji
Takashi Ikegami
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.

Download Info
To 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.

Publisher Info
Paper provided by Santa Fe Institute in its series Working Papers with number 01-12-083.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: Dec 2001
Date of revision:
Handle: RePEc:wop:safiwp:01-12-083

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

For technical questions regarding this item, or to correct its listing, contact: (Thomas Krichel).

Related research
Keywords: Smale's horseshoe HŽnon map symbolic dynamics non-hyperbolicity computational complexity

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? You can use convenient plug-ins to search directly IDEAS from your browser.

This page was last updated on 2008-8-25.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.