Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets (Q4337649)
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: Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets |
scientific article; zbMATH DE number 1012886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets |
scientific article; zbMATH DE number 1012886 |
Statements
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets (English)
0 references
26 May 1997
0 references
unambiguous computation
0 references
Boolean hierarchy
0 references
sparse Turing-complete sets
0 references
0.7719039916992188
0 references
0.7717945575714111
0 references
0.7709994912147522
0 references
0.7678124308586121
0 references
0.7662209868431091
0 references
