Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
From MaRDI portal
Publication:2117588
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
Cites work
- scientific article; zbMATH DE number 5862894 (Why is no real title available?)
- scientific article; zbMATH DE number 3881877 (Why is no real title available?)
- scientific article; zbMATH DE number 3898846 (Why is no real title available?)
- scientific article; zbMATH DE number 3942990 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 3941494 (Why is no real title available?)
- scientific article; zbMATH DE number 4080902 (Why is no real title available?)
- scientific article; zbMATH DE number 4108154 (Why is no real title available?)
- scientific article; zbMATH DE number 193560 (Why is no real title available?)
- scientific article; zbMATH DE number 3506145 (Why is no real title available?)
- scientific article; zbMATH DE number 3508476 (Why is no real title available?)
- scientific article; zbMATH DE number 1502617 (Why is no real title available?)
- scientific article; zbMATH DE number 3227504 (Why is no real title available?)
- scientific article; zbMATH DE number 3229496 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- scientific article; zbMATH DE number 3066801 (Why is no real title available?)
- Algorithmic properties of structures
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computability of Recursive Functions
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Fifty years of the spectrum problem: survey and new results
- Foundations of Information and Knowledge Systems
- Generalized Program Schemas
- Milestones in analog and digital computing. Volumes I and II. Translated from the German by John McMinn
- On Ianov's Program Schemata
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On formalised computer programs
- On matrix program schemes
- On the equivalence and transformation of program schemes
- Pascal. User manual and report
- Query languages for hierarchic databases
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- The classical decision problem.
- The fundamental theorem of algebra and complexity theory
- Turing machines and the spectra of first-order formulas
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)