Some thoughts on computational models: from massive human computing to abstract state machines, and beyond

DOI10.1007/978-3-030-76020-5_10OpenAlexW3170295025MaRDI QIDQ2117588

Johann A. Makowsky

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-76020-5_10

zbMATH Keywords

abstract state machinescomputational modelsregister machinesprogram schemasBlum-Shub-Smale over relational structures

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable queries for relational data bases
• Datalog extensions for database queries and updates
• Query languages for hierarchic databases
• Structure and complexity of relational queries
• Pascal. User manual and report
• On formalised computer programs
• On the equivalence and transformation of program schemes
• On matrix program schemes
• Relational queries computable in polynomial time
• The fundamental theorem of algebra and complexity theory
• Generalized Program Schemas
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Turing machines and the spectra of first-order formulas
• Fifty years of the spectrum problem: survey and new results
• Milestones in Analog and Digital Computing
• Algorithmic properties of structures
• Computability of Recursive Functions
• On Ianov's Program Schemata
• Foundations of Information and Knowledge Systems
• The classical decision problem.

This page was built for publication: Some thoughts on computational models: from massive human computing to abstract state machines, and beyond