Algorithmical unsolvability of the ergodicity problem for locally interacting processes with continuous time

DOI10.1023/A:1018699527637MaRDI QIDQ1976764zbMATH OpenOpenAlexFDO

Authors A. Toom

Publication date 13 November 2000

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018699527637

zbMATH Keywords

ergodicityinteracting particle systemsrandom processesTuring machineunsolvability

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Interacting particle systems in time-dependent statistical mechanics (82C22)

Recommendations

• Algorithmical unsolvability of the ergodicity problem for binary cellular automata
• Ergodicity of one locally interacting system of automata
• COUPLING INTERACTING PARTICLE SYSTEMS
• EXTENDED APPLICATION OF CONSTRUCTIVE CRITERIA FOR ERGODICITY OF INTERACTING PARTICLE SYSTEMS
• Randomness and the ergodic decomposition

Cited in

(4)

• Ergodicity of one locally interacting system of automata
• Algorithmical unsolvability of the ergodicity problem for binary cellular automata
• Probabilistic cellular automata with Andrei Toom
• Eroders on a plane with three states at a point. I: Deterministic

This page was built for publication: Algorithmical unsolvability of the ergodicity problem for locally interacting processes with continuous time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976764)