Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Universal computation and physical dynamics

From MaRDI portal
Publication:1896542
Jump to:navigation, search

DOI10.1016/0167-2789(95)00107-FzbMath0885.68056MaRDI QIDQ1896542

Charles H. Bennett

Publication date: 29 August 1995

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


zbMATH Keywords

numerical simulationdeductive logic


Mathematics Subject Classification ID

Topological dynamics (37B99) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items

COLLISION-BASED COMPUTING IN BIOPOLYMERS AND THEIR AUTOMATA MODELS, Physical complexity of symbolic sequences, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Natural complexity, computational complexity and depth



Cites Work

  • Reliable computation with cellular automata
  • Correlations in classical ground states
  • Conservative logic
  • Randomness conservation inequalities; information and independence in mathematical theories
  • Nonrecursive tilings of the plane. II
  • A Theory of Program Size Formally Identical to Information Theory
  • Algorithmic Information Theory
  • Unpredictability and undecidability in dynamical systems
  • THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1896542&oldid=14305431"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki