Renormalisation and computation II: time cut-off and the Halting Problem
From MaRDI portal
Publication:2919937
DOI10.1017/S0960129511000508zbMath1291.68169MaRDI QIDQ2919937
Publication date: 23 October 2012
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
anytime algorithmsalgorithmic computationsHopf algebra renormalisation of the halting problemtime cut-off
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Contraction of Dirac matrices via chord diagrams ⋮ A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence ⋮ A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ Non-perturbative graph languages, halting problem and complexity ⋮ Anytime Algorithms for Non-Ending Computations ⋮ From Dyson-Schwinger equations to quantum entanglement ⋮ Entropy algebras and Birkhoff factorization ⋮ The complexities of nonperturbative computations ⋮ Zipf's law and L. Levin probability distributions
Cites Work
- Unnamed Item
- Natural halting probabilities, partial randomness, and zeta functions
- The fractal nature of Riem/Diff. I.
- Most programs stop quickly or never halt
- Physics, Topology, Logic and Computation: A Rosetta Stone
- An existence theorem for recursion categories
- Gödel numberings of partial recursive functions
- A Course in Mathematical Logic for Mathematicians
- Optimal enumerations and optimal gödel numberings
- Computability Theory and Differential Geometry
- Causal nets or what is a deterministic computation?
This page was built for publication: Renormalisation and computation II: time cut-off and the Halting Problem
