Queues, Stacks, and Transcendentality at the Transition to Chaos

Cristopher Moore and Porus Lakdawala

Working Papers from Santa Fe Institute

Abstract: We examine the one-humped map at the period-doubling transition to chaos, and ask whether its long-term memory is stack-like (last-in, first-out) or queue-like (first-in, first-out). We show that it can be recognized by a real-time automaton with one queue, or two stacks, and give several new grammatical characterizations of it. We argue that its memory has a queue-like character, since a single stack does not suffice.

We also show that its dynamical zeta function, generating function and growth function are transcendental. The same results hold for any period-multiplying cascade. We suggest that transcendentality might be a sign of dynamical phase transitions in other systems as well.

Keywords: Period-doubling cascade; bifurcation; symbolic dynamics; data structures; long-term correlations; generating functions. (search for similar items in EconPapers)
Date: 1998-12
View list of references

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: http://EconPapers.repec.org/RePEc:wop:safiwp:98-12-112

Access Statistics for this paper

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