The calculi of emergence: Computation, dynamics and induction
From MaRDI portal
Publication:1817022
DOI10.1016/0167-2789(94)90273-9zbMath0860.68046OpenAlexW2001616149MaRDI QIDQ1817022
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
Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80) Measures of information, entropy (94A17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of computing (68Q99)
Related Items (74)
Exact complexity: the spectral decomposition of intrinsic computation ⋮ Statistical signatures of structural organization: the case of long memory in renewal processes ⋮ Statistical complexity, virial expansion, and van der Waals equation ⋮ Correlated biased random walk with latency in one and two dimensions: asserting patterned and unpredictable movement ⋮ Traveling patterns in cellular automata ⋮ Application of computational mechanics to the analysis of seismic time-series via numerical optimisation ⋮ Predictive rate-distortion for infinite-order Markov processes ⋮ Dynamically changing interface as a model of measurement in complex systems ⋮ What is a complex system? ⋮ Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction ⋮ Disequilibrium, thermodynamic relations, and Rényi's entropy ⋮ Leveraging environmental correlations: the thermodynamics of requisite variety ⋮ Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions ⋮ Statistical manifestation of quantum correlations via disequilibrium ⋮ A measure of statistical complexity based on predictive information with application to finite spin systems ⋮ Fluctuations when driving between nonequilibrium steady states ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ Disentangling complexity from randomness and chaos ⋮ Reservoir computing quality: connectivity and topology ⋮ Optimality and complexity in measured quantum-state stochastic processes ⋮ Topology, convergence, and reconstruction of predictive states ⋮ Semipredictable dynamical systems ⋮ Quantum theory in finite dimension cannot explain every general process with finite memory ⋮ Emergent behaviors in social networks of adaptive agents ⋮ Grammatical complexity of one-dimensional maps with multiple monotone intervals ⋮ Logic from nonlinear dynamical evolution ⋮ Measures of statistical complexity: why? ⋮ The neglected pillar of material computation ⋮ Computation in finitary stochastic and quantum processes ⋮ High end complexity ⋮ TOOLS FOR NETWORK DYNAMICS ⋮ Emergence, closure and inter-level causation in biological systems ⋮ Regularities unseen, randomness observed: Levels of entropy convergence ⋮ Anomaly detection in complex system based on epsilon machine ⋮ Self-organized criticality resulting from minimization of perpetual disequilibration ⋮ Nonlinear dynamics as an engine of computation ⋮ ∊-Machine spectral reconstruction theory: a direct method for inferring planar disorder and structure from X-ray diffraction studies ⋮ Quantum cognition and bounded rationality ⋮ Entanglement dynamics in quantum cellular automata ⋮ Emergence and Universal Computation ⋮ Predictive models and generative complexity ⋮ Emergence in entity grammar systems ⋮ Central limit theorem for chemical kinetics in complex systems ⋮ Rule Extraction from Recurrent Neural Networks: ATaxonomy and Review ⋮ Elman Backpropagation as Reinforcement for Simple Recurrent Networks ⋮ Statistical complexity measures as telltale of relevant scales in emergent dynamics of spatial systems ⋮ Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters ⋮ ECONOPHYSICS AND ECONOMIC COMPLEXITY ⋮ Computational mechanics of cellular automata: an example ⋮ Effect of neuromodulation of short-term plasticity on information processing in hippocampal interneuron synapses ⋮ INFERENCE VERSUS IMPRINT IN CLIMATE MODELING ⋮ Characterizing turbulence in globally coupled maps with stochastic finite automata ⋮ Shannon entropy rate of hidden Markov processes ⋮ Stack-like and queue-like dynamics in recurrent neural networks ⋮ Spatial updating, spatial transients, and regularities of a complex automaton with nonperiodic architecture ⋮ The Liang-Kleeman information flow: theory and applications ⋮ COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS ⋮ Prediction and dissipation in nonequilibrium molecular sensors: conditionally Markovian channels driven by memoryful environments ⋮ Orthomodular lattice obtained from addressing a fixed point ⋮ ON THE GENERATIVE NATURE OF PREDICTION ⋮ Self-organisation and emergence in artificial life: concepts and illustrations ⋮ Quantum automata and quantum grammars ⋮ The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx ⋮ Journeys in non-classical computation I: A grand challenge for computing research ⋮ Prediction, retrodiction, and the amount of information stored in the present ⋮ Strong and weak optimizations in classical and quantum models of stochastic processes ⋮ Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation ⋮ Optimal causal inference: Estimating stored information and approximating causal architecture ⋮ Nature computes: Information processing in quantum dynamical systems ⋮ EMERGENT PERIODIC BEHAVIOR IN COUPLED CHAOTIC SYSTEMS ⋮ Reductions of hidden information sources ⋮ Information symmetries in irreversible processes ⋮ Local entropy and structure in a two-dimensional frustrated system ⋮ From equations to patterns: Logic-based approach to general systems theory
Uses Software
Cites Work
- 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
- 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
This page was built for publication: The calculi of emergence: Computation, dynamics and induction