Algorithmic arguments in physics of computation

DOI10.1007/3-540-60220-8_73zbMATH Open1502.68140OpenAlexW2096278915MaRDI QIDQ5057445FDOQ5057445

Authors: Paul M. B. Vitányi, Ming Li 

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_73

Recommendations

• scientific article; zbMATH DE number 3958735
• Energy Arguments in the Theory of Algorithms
• scientific article; zbMATH DE number 2187721
• Kolmogorov complexity arguments in combinatorics
• Publication:4939149

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of time-dependent statistical mechanics (82C03)

Cites Work

• A Mathematical Theory of Communication
• Title not available (Why is that?)
• Conservative logic
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Time/Space Trade-Offs for Reversible Computation
• Two heads are better than two tapes
• Thermodynamics of computation and information distance
• Title not available (Why is that?)
• Locality, Communication, and Interconnect Length in Multicomputers
• Reversibility and adiabatic computation: trading time and space for energy

Cited In (2)

• A notion of information related to computation
• Algorithmic foundations for the diffraction limit

This page was built for publication: Algorithmic arguments in physics of computation

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