Feasibilism, Explication, and the Cobham-Edmonds Thesis
计算复杂性
2026-07-01 v1
摘要
While the Church-Turing thesis asserts that effective calculability explicates to sets decidable by a Turing machine, the Cobham-Edmonds thesis asserts that feasible computation explicates to the complexity class , those decidable by a polynomial-time bounded Turing machine. The Church-Turing thesis has been placed under rigorous scrutiny and has several convincing arguments in its favor, but the Cobham-Edmonds thesis has not undergone a similar examination. Many of the arguments in its favor simply suggest that is a useful assumption, rather than a necessary target. This paper presents analogous arguments in favor of the Cobham-Edmonds thesis.
引用
@article{arxiv.2607.00315,
title = {Feasibilism, Explication, and the Cobham-Edmonds Thesis},
author = {Abrahim Ladha and Yiran Luo and Alan Tian},
journal= {arXiv preprint arXiv:2607.00315},
year = {2026}
}