When are Two Algorithms the Same?

DOI10.2178/bsl/1243948484zbMath1192.03021arXiv0811.0811OpenAlexW2169192695MaRDI QIDQ3633205

Nachum Dershowitz, Andreas Blass, Yuri Gurevich

Publication date: 17 June 2009

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

algorithmChurch-Turing thesis

Mathematics Subject Classification ID

Computability and recursion theory (03D99) General topics in the theory of algorithms (68W01) General topics in the theory of computing (68Q01)

Related Items (4)

2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Predicativity, the Russell-Myhill paradox, and Church's intensional logic ⋮ Galois Theory of Algorithms ⋮ Semantics-to-Syntax Analyses of Algorithms

Cites Work

• Linear logic
• Ordinary interactive small-step algorithms, I
• Deductive systems and categories
• Sequential abstract-state machines capture sequential algorithms
• Unnamed Item

This page was built for publication: When are Two Algorithms the Same?