The calculi of emergence: Computation, dynamics and induction

DOI10.1016/0167-2789(94)90273-9zbMath0860.68046MaRDI QIDQ1817022

James P. Crutchfield

Publication date: 1 December 1996

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-2789(94)90273-9

zbMATH Keywords

cellular automata pattern recognition; complexity metrics

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

68Q80: Cellular automata (computational aspects)

94A17: Measures of information, entropy

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

68Q99: Theory of computing

Related Items

INFERENCE VERSUS IMPRINT IN CLIMATE MODELING, Traveling patterns in cellular automata, Emergence and Universal Computation, Rule Extraction from Recurrent Neural Networks: ATaxonomy and Review, Elman Backpropagation as Reinforcement for Simple Recurrent Networks, The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx, Journeys in non-classical computation I: A grand challenge for computing research, TOOLS FOR NETWORK DYNAMICS, Regularities unseen, randomness observed: Levels of entropy convergence, Self-organized criticality resulting from minimization of perpetual disequilibration, Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions, The neglected pillar of material computation, Computation in finitary stochastic and quantum processes, Characterizing turbulence in globally coupled maps with stochastic finite automata, Dynamically changing interface as a model of measurement in complex systems, Quantum automata and quantum grammars, Orthomodular lattice obtained from addressing a fixed point, Grammatical complexity of one-dimensional maps with multiple monotone intervals, Measures of statistical complexity: why?, Entanglement dynamics in quantum cellular automata, Central limit theorem for chemical kinetics in complex systems, Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters, Reductions of hidden information sources, From equations to patterns: Logic-based approach to general systems theory, Stack-like and queue-like dynamics in recurrent neural networks, COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS, EMERGENT PERIODIC BEHAVIOR IN COUPLED CHAOTIC SYSTEMS, High end complexity, ECONOPHYSICS AND ECONOMIC COMPLEXITY, Spatial updating, spatial transients, and regularities of a complex automaton with nonperiodic architecture, ON THE GENERATIVE NATURE OF PREDICTION

Uses Software

• Boids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation theory of cellular automata
• Toward a quantitative theory of self-generated complexity
• Modeling by shortest data description
• Hydrodynamic instabilities and the transition to turbulence
• QRT FIFO automata, breadth-first grammars and their relations
• The attractor-basin portrait of a cellular automaton
• ``The arrival of the fittest: Toward a theory of biological organization
• Turbulent pattern bases for cellular automata
• Subshifts of finite type and sofic systems
• Identifiability of hidden Markov information sources and their minimum degrees of freedom
• Attractor vicinity decay for a cellular automaton
• The chemical basis of morphogenesis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• An Information Measure for Classification
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part II
• On the Identifiability Problem for Functions of Finite Markov Chains