并发算法概念形式化之论
计算复杂性
2026-01-21 v3 数据结构与算法
计算机科学中的逻辑
摘要
先前的论文给出了对经典非正式算法概念以及当代非正式交互式算法概念进行满意形式化探求的 account。本文尝试将前者的成果推广到当代非正式并发算法概念。引入并发原型算法的概念。认为并发算法是并发原型算法在适当等价关系下的等价类。定义了三个等价关系。其中两个被视为对适当等价关系的限制，第三个可能是合适的等价关系。在所呈现的设置下，也讨论了并发性与非确定性之间的联系。
引用
@article{arxiv.2410.17821,
title = {On the formalization of the notion of a concurrent algorithm},
author = {C. A. Middelburg},
journal= {arXiv preprint arXiv:2410.17821},
year = {2026}
}
备注
20 pages. It has recently been discovered that the serious flaws that led to the withdrawal of version 1 in March 2025 can, surprisingly enough, be repaired by minor changes to the definitions of the algorithmic and computational step functions and to the proof of Theorem 3