Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0168-0072(94)00062-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968367799 / rank | |||
Normal rank | |||
Revision as of 02:34, 20 March 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
