On Chaitin's Heuristic Principle and Halting Probability
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913019643035648 |
|---|---|
| author | Salehi, Saeed |
| author_facet | Salehi, Saeed |
| contents | It would be a heavenly reward if there were a method of weighing theories and sentences in such a way that a theory could never prove a heavier sentence (Chaitin's Heuristic Principle). Alas, no satisfactory measure has been found so far, and this dream seemed too good ever to come true. In the first part of this paper, we attempt to revive Chaitin's lost paradise of heuristic principle as much as logic allows. In the second part, which is a joint work with M. Jalilvand and B. Nikzad, we study Chaitin's well-known constant Omega and show that this number is not a probability of halting the randomly chosen input-free programs under any infinite discrete measure. We suggest several methods for defining halting probabilities using various measures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_14807 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On Chaitin's Heuristic Principle and Halting Probability Salehi, Saeed Logic Information Theory Logic in Computer Science 03F40, 68Q30, 60A10, 28A05, 68Q04, 03D10 It would be a heavenly reward if there were a method of weighing theories and sentences in such a way that a theory could never prove a heavier sentence (Chaitin's Heuristic Principle). Alas, no satisfactory measure has been found so far, and this dream seemed too good ever to come true. In the first part of this paper, we attempt to revive Chaitin's lost paradise of heuristic principle as much as logic allows. In the second part, which is a joint work with M. Jalilvand and B. Nikzad, we study Chaitin's well-known constant Omega and show that this number is not a probability of halting the randomly chosen input-free programs under any infinite discrete measure. We suggest several methods for defining halting probabilities using various measures. |
| title | On Chaitin's Heuristic Principle and Halting Probability |
| topic | Logic Information Theory Logic in Computer Science 03F40, 68Q30, 60A10, 28A05, 68Q04, 03D10 |
| url | https://arxiv.org/abs/2310.14807 |