Relativized Halting Problems
โ Scribed by Alan L. Selman
- Book ID
- 102485246
- Publisher
- John Wiley and Sons
- Year
- 1974
- Tongue
- English
- Weight
- 349 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In RSOICER [l], the question was asked whether there is a TURING machine which halts on all "effectively generable" tapes but yet diverges on some tape. We make this question precise as follows. Let u be a function from the natural numbers N into N . Associate with a the two way infinite tape at of
The halting set Kr = (x I r converges}, for any G6del numbering ~ = {~0, ~1 ,-..}, is nonrecursive. It may be possible, however, to approximate Kr by recursive sets. We note several results indicating that the degrees of recursive approximability of halting sets in arbitrary GSdel numberings have wi