Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Towards the computational complexity of PR^ -terms |
scientific article; zbMATH DE number 802553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms |
scientific article; zbMATH DE number 802553 |
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
0.778594970703125
0 references
0.75493323802948
0 references
0.7459800243377686
0 references
