PECR: A formal system based on computability logic
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909146272497664 |
|---|---|
| author | Pantelis, G. |
| author_facet | Pantelis, G. |
| contents | PECR is a formal system designed to explore the properties of computability of programs on a real-world computer. As such PECR incorporates the finite resources of the machine upon which a program is to be executed. The main features of the formal system will be presented and its practical applications will be discussed. Of particular interest is the implementation of the formal system to the exploration of the laws of nature that lead to rigorous constructions of computer models of real-world phenomena. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14880 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | PECR: A formal system based on computability logic Pantelis, G. Logic in Computer Science PECR is a formal system designed to explore the properties of computability of programs on a real-world computer. As such PECR incorporates the finite resources of the machine upon which a program is to be executed. The main features of the formal system will be presented and its practical applications will be discussed. Of particular interest is the implementation of the formal system to the exploration of the laws of nature that lead to rigorous constructions of computer models of real-world phenomena. |
| title | PECR: A formal system based on computability logic |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2403.14880 |