𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Turing complexity of the ordinals

✍ Scribed by Patrick Dehornoy

Book ID
113162955
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
272 KB
Volume
23
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Turing way to parameterized complexi
The Turing way to parameterized complexity
✍ Marco Cesati πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 280 KB

We propose a general proof technique based on the Turing machine halting problem that allows us to establish membership results for the classes W[1], W[2], and W[P]. Using this technique, we prove that Perfect Code belongs to W[1], Steiner Tree belongs to W[2], and a-Balanced Separator, Maximal Irre

About Segment Complexity of Turing Reduc
About Segment Complexity of Turing Reductions
✍ Valeriy K. Bulitko πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 645 KB

We apply complexity concepts to define a new sort of sub-Turing reducibilities 5 8 to make the degree hierarchy thinner and to obtain some new specifications of the well known jump inversion theorem of Friedberg. We show that this theorem doesn't hold when ST is replaced with 58, where 5 is any coun