Execution trace sets for real computation

DOI10.1016/J.TCS.2022.06.038MaRDI QIDQ2699944zbMATH OpenOpenAlexFDO

Authors 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

Blum-Shub-Smale machinegeneral algorithmsreal computationtrace semantics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Computable execution traces
• New Computational Paradigms
• Computing over the reals: foundations for scientific computing.
• scientific article; zbMATH DE number 517066
• Real computations with fake numbers

Cites work

• About primitive recursive algorithms
• Abstract State Machines
• Algorithms and the mathematical foundations of computer science
• Computable execution traces
• Evolving Algebras 1993: Lipari Guide
• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 1301806 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Linear Automaton Transformations
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the asymptotic behaviour of primitive recursive algorithms
• Process logic: Expressiveness, decidability, completeness
• Sequential abstract-state machines capture sequential algorithms
• The Church-Turing Thesis over Arbitrary Domains
• The prospects for mathematical logic in the twenty-first century
• Trace Semantics for IPDL
• What is an algorithm?

Cited in

(1)

• Computable execution traces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2699944)