Optimal enumerations and optimal gödel numberings (Q4075448): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Claus Peter Schnorr / rank
Normal rank
 
Property / author
 
Property / author: Claus Peter Schnorr / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of machines / 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: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program size in restricted programming languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:37, 12 June 2024

scientific article
Language Label Description Also known as
English
Optimal enumerations and optimal gödel numberings
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references