On the formalization of the notion of a concurrent algorithm
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908774589005824 |
|---|---|
| author | Middelburg, C. A. |
| author_facet | Middelburg, C. A. |
| contents | Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algoritm. In this paper, an attempt is made to generalize the results of the former quest to the contemporary informal notion of a concurrent algorithm. The notion of a concurrent proto-algorithm is introduced. The thought is that concurrent algorithms are equivalence classes of concurrent proto-algorithms under an appropriate equivalence relation. Three equivalence relations are defined. Two of them are deemed to be bounds for an appropriate equivalence relation and the third is likely an appropriate one. The connection between concurrency and non-determinism in the presented setting is also addressed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_17821 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the formalization of the notion of a concurrent algorithm Middelburg, C. A. Computational Complexity Data Structures and Algorithms Logic in Computer Science F.1.1; F.1.2; F.2.0 Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algoritm. In this paper, an attempt is made to generalize the results of the former quest to the contemporary informal notion of a concurrent algorithm. The notion of a concurrent proto-algorithm is introduced. The thought is that concurrent algorithms are equivalence classes of concurrent proto-algorithms under an appropriate equivalence relation. Three equivalence relations are defined. Two of them are deemed to be bounds for an appropriate equivalence relation and the third is likely an appropriate one. The connection between concurrency and non-determinism in the presented setting is also addressed. |
| title | On the formalization of the notion of a concurrent algorithm |
| topic | Computational Complexity Data Structures and Algorithms Logic in Computer Science F.1.1; F.1.2; F.2.0 |
| url | https://arxiv.org/abs/2410.17821 |