Algorithms: From Al-Khwarizmi to Turing and Beyond

DOI10.1007/978-3-319-22156-4_2zbMath1384.68003OpenAlexW2409075040MaRDI QIDQ4637216

Wolfgang Thomas

Publication date: 18 April 2018

Published in: Turing’s Revolution (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22156-4_2

zbMATH Keywords

algorithmlogiccomputabilityTuringLeibnizAl-Khwarizmi

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) History of computer science (68-03) General topics in the theory of algorithms (68W01)

Cites Work

• Thus spake al-Ḵẖwārizmī: A translation of the text of Cambridge University library ms. ii.vi.5
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Sequential abstract-state machines capture sequential algorithms
• A note on the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursively enumerable sets of positive integers and their decision problems
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms: From Al-Khwarizmi to Turing and Beyond