Succinct iterative characterizations of primitive computable unary functions (Q672834): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: ITERATION AND RECURSION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5612462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of partial recursivity and computability by algorithms without concluding formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4087154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence-to-sequence recursiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable stack functions for semantics of stack programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence recursiveness without cylindrification and limited register machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive iteration and unary functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: General iteration and unary functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Characterizations of Computable Unary Functions: A General Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive recursive functions / rank
 
Normal rank

Latest revision as of 10:20, 27 May 2024

scientific article
Language Label Description Also known as
English
Succinct iterative characterizations of primitive computable unary functions
scientific article

    Statements

    Identifiers