Asymptotic proportion of hard instances of the halting problem
Although the halting problem is undecidable, imperfect testers that fail on some instances are possible. Such instances are called hard for the tester. One variant of imperfect testers replies "I don't know" on hard instances, another variant fails to halt, and yet another replies inc...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2014
|
| Sorozat: | Acta cybernetica
21 No. 3 |
| Kulcsszavak: | Számítástechnika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.21.3.2014.3 |
| Online Access: | http://acta.bibl.u-szeged.hu/34471 |
| Tartalmi kivonat: | Although the halting problem is undecidable, imperfect testers that fail on some instances are possible. Such instances are called hard for the tester. One variant of imperfect testers replies "I don't know" on hard instances, another variant fails to halt, and yet another replies incorrectly "yes" or "no". Also the halting problem has three variants: does a given program halt on the empty input, does a given program halt when given itself as its input, or does a given program halt on a given input. The failure rate of a tester for some size is the proportion of hard instances among all instances of that size. This publication investigates the behaviour of the failure rate as the size grows without limit. Earlier results are surveyed and new results are proven. Some of them use C++ on Linux as the computational model. It turns out that the behaviour is sensitive to the details of the programming language or computational model, but in many cases it is possible to prove that the proportion of hard instances does not vanish. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 307-330 |
| ISSN: | 0324-721X |