A predicative and decidable characterization of the polynomial classes of languages (Q1589422): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Salvatore Caporaso / rank
 
Normal rank
Property / author
 
Property / author: Michele Zito / rank
 
Normal rank
Property / author
 
Property / author: Nicola Galesi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability vs transfinite induction for the consistency of hyperarithmetical sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beweistheoretische Untersuchung der verzweigten Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rekursionszahlen und die Grzegorczyk-Hierarchie / rank
 
Normal rank

Latest revision as of 11:11, 3 June 2024

scientific article
Language Label Description Also known as
English
A predicative and decidable characterization of the polynomial classes of languages
scientific article

    Statements

    A predicative and decidable characterization of the polynomial classes of languages (English)
    0 references
    12 December 2000
    0 references
    0 references
    computational complexity
    0 references
    predicative recursion
    0 references
    functional programming
    0 references
    Lisp
    0 references
    0 references
    0 references
    0 references