Execution trace sets for real computation

DOI10.1016/j.tcs.2022.06.038OpenAlexW4285500525MaRDI QIDQ2699944

Declan Thompson

Publication date: 20 April 2023

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

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

zbMATH Keywords

real computationtrace semanticsBlum-Shub-Smale machinegeneral algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process logic: Expressiveness, decidability, completeness
• About primitive recursive algorithms
• Computable execution traces
• The Prospects for Mathematical Logic in the Twenty-First Century
• What Is an Algorithm?
• Linear Automaton Transformations
• Trace Semantics for IPDL
• Abstract State Machines
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Evolving Algebras 1993: Lipari Guide
• Algorithms and the Mathematical Foundations of Computer Science
• The Church-Turing Thesis over Arbitrary Domains
• Sequential abstract-state machines capture sequential algorithms
• On the asymptotic behaviour of primitive recursive algorithms

This page was built for publication: Execution trace sets for real computation