Computational Mechanics: Pattern and Prediction, Structure and Simplicity
AbstractComputational mechanics, an approach to structural complexity, defines a process's causal states and gives a procedure for finding them. We show that the causal-state representation--an e-machine--is the minimal one consistent with accurate prediction. We establish several results on e-machine optimality and uniqueness and on how e-machines compare to alternative representations. Further results relate measures of randomness and structural complexity obtained from e-machines to those from ergodic and information theories.
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 99-07-044.
Date of creation: Jul 1999
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
Complexity; computation; entropy; information; pattern; statistical mechanics;
This paper has been announced in the following NEP Reports:
- NEP-ALL-1999-09-21 (All new papers)
- NEP-CMP-1999-10-04 (Computational Economics)
- NEP-EVO-1999-09-21 (Evolutionary Economics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
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.