Renormalisation and computation II: time cut-off and the Halting Problem (Q2919937): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Theory and Differential Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal nets or what is a deterministic computation? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal enumerations and optimal gödel numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural halting probabilities, partial randomness, and zeta functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gödel numberings of partial recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most programs stop quickly or never halt / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractal nature of Riem/Diff. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physics, Topology, Logic and Computation: A Rosetta Stone / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Course in Mathematical Logic for Mathematicians / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theorem for recursion categories / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:58, 5 July 2024

scientific article
Language Label Description Also known as
English
Renormalisation and computation II: time cut-off and the Halting Problem
scientific article

    Statements

    Renormalisation and computation II: time cut-off and the Halting Problem (English)
    0 references
    0 references
    23 October 2012
    0 references
    algorithmic computations
    0 references
    time cut-off
    0 references
    anytime algorithms
    0 references
    Hopf algebra renormalisation of the halting problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references