Explore tens of thousands of sets crafted by our community.
Computational Models
4
Flashcards
0/4
Finite State Machine (FSM)
An abstract machine that can be in exactly one of a finite number of states at any given time. It can change from one state to another in response to some external inputs.
Cellular Automata
A discrete model studied in computational science, consisting of a regular grid of cells, each in one of a finite number of states. The state of each cell is updated based on its neighbors' states, following a fixed rule.
Lambda Calculus
A formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation.
Turing Machine
A mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a set of rules. Capable of simulating any algorithm.
© Hypatia.Tech. 2024 All rights reserved.
