Execution trace sets for real computation
From MaRDI portal
Recommendations
Cites work
- About primitive recursive algorithms
- Abstract state machines. A method for high-level system design and analysis (with CD-ROM)
- Algorithms and the mathematical foundations of computer science
- Computable analysis. An introduction
- 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?)
- 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?
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)