Some Remarks on Uniform Halting Problems
โ Scribed by Stephen L. Bloom
- Publisher
- John Wiley and Sons
- Year
- 1971
- Tongue
- English
- Weight
- 200 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
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 blanks (B's) and 1's; where or'= .
๐ SIMILAR VOLUMES
## Abstract We prove a conjecture of Favaron et al. that every graph of order __n__ and minimum degree at least three has a total dominating set of size at least __n__/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bo