Towards a Definition of an Algorithm

DOI10.1093/logcom/exq016zbMath1214.68459arXivmath/0602053OpenAlexW2008901851MaRDI QIDQ3006116

Noson S. Yanofsky

Publication date: 10 June 2011

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0602053

zbMATH Keywords

equivalence of programsoperadsGrzegorczyk's hierarchyformal algorithms

Mathematics Subject Classification ID

Categories of machines, automata (18B20) General topics in the theory of algorithms (68W01)

Related Items

A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence, Complexity bounds for container functors and comonads, The dependence of computability on numerical notations, From Dyson-Schwinger equations to quantum entanglement, Galois Theory of Algorithms, The complexities of nonperturbative computations, Zipf's law and L. Levin probability distributions, Axiomatization and characterization of BSP algorithms