Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4281467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4842532 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4010352 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subrecursive hierarchies on Scott domains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4876432 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: LCF considered as a programming language / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5457388 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3959414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4775862 / rank | |||
Normal rank |
Latest revision as of 17:31, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms |
scientific article |
Statements
Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (English)
0 references
14 February 1996
0 references
partial primitive recursive functionals
0 references
prenormal terms
0 references
structural complexity
0 references