Live briefing
Everything about Model of computation
Mathematical model describing how an output of a function is computed given an input
In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model that describes how an output of a mathematical function is computed given an input. A model of computation describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Model of computationA 5-minute orientation
- Skim a recent paper: Towards a general-purpose foundation model for computational pathologyInfluential work since 2022
- Pick up a classic book: Computational Biomechanics for MedicineThe most-reprinted book on the subject
- Read the landmark paper: A bridging model for parallel computationCited 2,636 times
- Go sideways: Random-access Turing machineA closely related topic
- Go sideways: List of computability and complexity topicsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A bridging model for parallel computation
Bayesian Computation and Model Selection Without Likelihoods
A Sticker-Based Model for DNA Computation
The uniform memory hierarchy model of computation
Model selection by MCMC computation
A model of computation in neocortical architecture
Statistical Model Computation with UDFs
Significance of Models of Computation, from Turing Model to Natural Computation
🆕 Influential since 2022
Towards a general-purpose foundation model for computational pathology
A visual-language foundation model for computational pathology
A foundation model for clinical-grade computational pathology and rare cancers detection
Computation and Communication Efficient Federated Learning With Adaptive Model Pruning
Efficient evolutionary computation model of closed high-utility itemset mining
📚 Books worth reading
Computational Biomechanics for MedicineAdam Wittek · 2012
The Psychology of Everyday ThingsDonald A. Norman · 1988
Extending the Linear Model with RJulian J. Faraway · 2004
Computational physicsRubin H. Landau, Manuel J. Páez · 1997
Modeling and Optimization: Theory and ApplicationsTamás Terlaky · 2012
Statistics for engineering and the sciencesWilliam Mendenhall, Terry Sincich · 1991
Information Computing and ApplicationsBaoxiang Liu · 2010
Resource economicsJon M. Conrad · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Random-access Turing machine In computational complexity, a field of theoretical computer science, random-access Turing machines extend the functionality of conventional Turing machines…
- List of computability and complexity topics This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with…
- Abstract machine In computer science, an abstract machine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions. It…
- Computability Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic…
- Theory of computation In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation…
- Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table…
- Unbounded nondeterminism In computer science, unbounded nondeterminism or unbounded indeterminacy refers to a behavior in concurrency (multiple tasks running at once) where a process…
- Computable function Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes…