𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nondeterministic bounded query reducibilities

✍ Scribed by Richard Beigel; William Gasarch; Jim Owings


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
776 KB
Volume
41
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On bounded query machines
✍ Jose L. BalcΓ‘zar; Ronald V. Book; Uwe SchΓΆning πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 452 KB
On existence of complete sets for bounde
✍ Valeriy Bulitko; Vadim Bulitko πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract Classical reducibilities have complete sets __U__ that any recursively enumerable set can be reduced to __U__. This paper investigates existence of complete sets for reducibilities with limited oracle access. Three characteristics of classical complete sets are selected and a natural hi

Frequency computation and bounded querie
✍ Richard Beigel; William Gasarch; Efim Kinber πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 1014 KB