Renormalisation and computation. II: Time cut-off and the halting problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1291.68169
DOI: 10.1017/S0960129511000508
author: Yuri I. Manin
publication date: 2012-10-23T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D75
Mathematics Subject Classification ID: 18D50
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6097864
zbMATH Keywords: algorithmic computations
zbMATH Keywords: time cut-off
zbMATH Keywords: anytime algorithms
zbMATH Keywords: Hopf algebra renormalisation of the halting problem
MaRDI profile type: Publication
cites work: Q4023358
cites work: Computability Theory and Differential Geometry
cites work: Causal nets or what is a deterministic computation?
cites work: Optimal enumerations and optimal gödel numberings
cites work: Natural halting probabilities, partial randomness, and zeta functions
cites work: Gödel numberings of partial recursive functions
cites work: Most programs stop quickly or never halt
cites work: The fractal nature of Riem/Diff. I.
cites work: Physics, Topology, Logic and Computation: A Rosetta Stone
cites work: A Course in Mathematical Logic for Mathematicians
cites work: An existence theorem for recursion categories
title: Renormalisation and computation. II: Time cut-off and the halting problem
published in: MSCS. Mathematical Structures in Computer Science
description: scientific article; zbMATH DE number 6097864