Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (Q2559259): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5672158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrecursive Programming Languages, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Classes of Program Schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symposium on semantics of algorithmic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5517672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Programs and the First-Order Predicate Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolvability in 3 × 3 Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating recursion equations into flow charts / rank
 
Normal rank

Latest revision as of 12:43, 12 June 2024

scientific article
Language Label Description Also known as
English
Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
scientific article

    Statements

    Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (English)
    0 references
    1972
    0 references
    0 references
    0 references
    0 references