No label defined (Q4938554)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1405575 |
Statements
20 September 2000
0 references
parallel queries
0 references
survey
0 references
bounded queries
0 references
frequency computation
0 references
verboseness
0 references
complexity of nonrecursive sets
0 references
0 references
0.8986281
0 references
0 references
0 references
0.87633514
0 references
0.86539286
0 references
0.8636574
0 references
0.86315763
0 references
0.86062276
0 references
The present work gives an overview on the field of bounded queries in recursion theory including the subfields of frequency computation and verboseness. The main topic is finding quantitative notions for the complexity of nonrecursive sets in terms of the local complexity of computing the \(n\)-fold characteristic function. This work presents in particular the various proof methods popular in this field. For the entire collection see [Zbl 0919.00039].
0 references
