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

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

Johann A. Makowsky

Publication date: 22 March 2022

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

Recommendations

• scientific article; zbMATH DE number 4128803
• Abstract state machines: a unifying view of models of computation and of system design frameworks
• Models of Computation: A Tribute to Ugo Montanari’s Vision
• Computability and models. Perspectives east and west
• Models of computation
• Models of computation. An introduction to computability theory
• Formal models of computation. The ultimate limits of computing
• scientific article; zbMATH DE number 1033441
• Computational mechanisms and models of computation

zbMATH Keywords

computational modelsabstract state machinesregister machinesprogram schemasBlum-Shub-Smale over relational structures

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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

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