On the structural simplicity of machines and languages (Q1924785): 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: Fixpoint logics, relational machines, and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program Schemes with Pushdown Stores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Classes of Program Schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next 700 programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation and the computational complexity of logic programs / rank
 
Normal rank

Latest revision as of 15:23, 24 May 2024

scientific article
Language Label Description Also known as
English
On the structural simplicity of machines and languages
scientific article

    Statements

    On the structural simplicity of machines and languages (English)
    0 references
    0 references
    0 references
    0 references
    20 October 1996
    0 references
    0 references
    computational complexity boundaries
    0 references
    Turing machines
    0 references