Thoughts on sub-Turing interactive computability
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929574618595328 |
|---|---|
| author | Japaridze, Giorgi |
| author_facet | Japaridze, Giorgi |
| contents | The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new approach would see such resources as external rather than internal to computing devices. They could or should be accounted for explicitly in the antecedents of logical formulas expressing computational problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01393 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Thoughts on sub-Turing interactive computability Japaridze, Giorgi Logic in Computer Science 03B47, 03B70, 03F03 F.4.1; F.1.2; F.1.3 The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new approach would see such resources as external rather than internal to computing devices. They could or should be accounted for explicitly in the antecedents of logical formulas expressing computational problems. |
| title | Thoughts on sub-Turing interactive computability |
| topic | Logic in Computer Science 03B47, 03B70, 03F03 F.4.1; F.1.2; F.1.3 |
| url | https://arxiv.org/abs/2411.01393 |