Some applications of computable one-one numberings (Q750430): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie Der Numerierungen III / 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: Q5625130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable single-valued numerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem of the number of non-self-equivalent constructivizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3961013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic degree of unars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Reduzierbarkeit berechenbarer Numerierungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on direct sums of Friedbergnumberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An easy priority-free proof of a theorem of Friedberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract First Order Computability. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Computability and Invariant Definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Godel Numberings Versus Friedberg Numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerations of families of general recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable one-to-one enumerations of effective domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform autostability of models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751553 / rank
 
Normal rank

Latest revision as of 12:34, 21 June 2024

scientific article
Language Label Description Also known as
English
Some applications of computable one-one numberings
scientific article

    Statements

    Some applications of computable one-one numberings (English)
    0 references
    0 references
    0 references
    1990
    0 references
    The author presents four connections of computable one-one numberings to computable CPOs, isomorphism classes of recursive functions, generalized computability and Turing degrees.
    0 references
    0 references
    computable CPO
    0 references
    computable one-one numberings
    0 references
    isomorphism classes of recursive functions
    0 references
    generalized computability
    0 references
    Turing degrees
    0 references