On Gurevich's theorem on sequential algorithms

DOI10.1007/s00236-002-0106-3zbMath1060.68045OpenAlexW1964595098MaRDI QIDQ1424349

Wolfgang Reisig

Publication date: 11 March 2004

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-002-0106-3

zbMATH Keywords

abstract-state machines

Mathematics Subject Classification ID

Related Items (4)

In some curved spaces, one can solve NP-hard problems in polynomial time ⋮ Axiomatizing Analog Algorithms ⋮ Unnamed Item ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis

This page was built for publication: On Gurevich's theorem on sequential algorithms