Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334)
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: Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals |
scientific article; zbMATH DE number 1042929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals |
scientific article; zbMATH DE number 1042929 |
Statements
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (English)
0 references
3 August 1997
0 references
higher-order procedure
0 references
0.783775269985199
0 references
0.7726439237594604
0 references
0.756269633769989
0 references
