# Sh:533

• Blass, A. R., Gurevich, Y., & Shelah, S. (1999). Choiceless polynomial time. Ann. Pure Appl. Logic, 100(1-3), 141–187.
• Abstract:
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured the negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic is more expressive than other PTime logics in the literature. A more difficult theorem shows that the logic does not capture all PTime.
• published version (47p)
Bib entry
@article{Sh:533,
author = {Blass, Andreas R. and Gurevich, Yuri and Shelah, Saharon},
title = {{Choiceless polynomial time}},
journal = {Ann. Pure Appl. Logic},
fjournal = {Annals of Pure and Applied Logic},
volume = {100},
number = {1-3},
year = {1999},
pages = {141--187},
issn = {0168-0072},
mrnumber = {1711992},
mrclass = {68Q19 (03C13 03D15 68Q10 68Q15)},
doi = {10.1016/S0168-0072(99)00005-6},
note = {\href{https://arxiv.org/abs/math/9705225}{arXiv: math/9705225}},
arxiv_number = {math/9705225},
referred_from_entry = {See [Sh:533a]}
}