𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Addendum to “computably enumerable sets and quasi-reducibility”

✍ Scribed by R. Downey; G. LaForte; A. Nies

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
29 KB
Volume
98
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computable limits and colimits in catego
Computable limits and colimits in categories of partial enumerated sets
✍ Andrzej Orlicki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 931 KB

## Abstract Computable limits and colimits are “recursive counterparts” of the suitable classical concepts from category theory. We present mainly some interesting problems related to computable products. Moreover, some “computable counterparts” of well‐known classical facts from category theory ar

P-Selective Sets and Reducing Search to
P-Selective Sets and Reducing Search to Decision vs Self-Reducibility
✍ Edith Hemaspaandra; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 684 KB

We distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. Results include: (i) If NE{E, then there exists a set L in NP&P such that search reduces to decision for L, search does not nonadaptively reduce to decision for L and L is not self-reducib