The computable kernel of abstract state machines

DOI10.1016/J.TCS.2008.08.041zbMath1158.68009OpenAlexW1977996496MaRDI QIDQ959826

Wolfgang Reisig

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.041

zbMATH Keywords

symbolic computationabstract state machines (ASMs)computability on Tarski structures

Mathematics Subject Classification ID

Related Items (3)

What is the Church-Turing Thesis? ⋮ Honest universality ⋮ Three Paths to Effectiveness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ASM refinement method
• Evolving Algebras 1993: Lipari Guide
• The Church-Turing Thesis over Arbitrary Domains
• Sequential abstract-state machines capture sequential algorithms

This page was built for publication: The computable kernel of abstract state machines