On Gurevich's theorem on sequential algorithms
From MaRDI portal
Recommendations
- Sequential algorithms for unbounded nondeterminism
- Sequential algorithms and strongly stable functions
- scientific article; zbMATH DE number 5606342
- Some results on greedy algorithm conjectures
- On weakly complete sequences formed by the greedy algorithm
- On Helly's theorem: Algorithms and extensions
- Algorithmic aspects of Suslin's proof of Serre's conjecture
- On Sequential Cores and a Theorem of R. R. Phelps
- Bounded Turing reductions and data processing inequalities for sequences
Cited in
(19)- Sequential abstract-state machines capture sequential algorithms
- Classes of algorithms: formalization and comparison
- scientific article; zbMATH DE number 1860674 (Why is no real title available?)
- Three paths to effectiveness
- scientific article; zbMATH DE number 1670509 (Why is no real title available?)
- Axiomatizing analog algorithms
- A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines
- An ASM-characterization of a class of distributed algorithms
- Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture
- Abstract State Machines 2004. Advances in Theory and Practice
- scientific article; zbMATH DE number 1543040 (Why is no real title available?)
- Exact exploration and hanging algorithms
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- scientific article; zbMATH DE number 1670467 (Why is no real title available?)
- A behavioural theory of recursive algorithms
- In some curved spaces, one can solve NP-hard problems in polynomial time
- A characterization of distributed ASMs with partial-order runs
- Cellular automata are generic
- scientific article; zbMATH DE number 4078560 (Why is no real title available?)
This page was built for publication: On Gurevich's theorem on sequential algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424349)
