A central idea in computability is that of a (computational) problem, which is a task whose computability can be explored.
There are two key types of problems:
• A decision problem fixes a set S, which may be a set of … See more

With these computational models in hand, we can determine what their limits are. That is, what classes of languages can they accept?
Power of finite-state machines
Computer scientists call any language that can be accepted by … See more

• Automata theory
• Abstract machine
• List of undecidable problems
• Computational complexity theory
• Computability logic See more

A model of computation is a formal description of a particular type of computational process. The description often takes the form of an abstract machine that … See more

A number of computational models based on concurrency have been developed, including the parallel random-access machine and … See more

The Church–Turing thesis conjectures that there is no effective model of computing that can compute more mathematical functions than a … See more