Teoria De Computacion

Teoria De Computacion

1. It is the branch that deals with the efficiency with which problems can be solved in a model calculation, using an algorithm.

2. It is divided into three major branches: the theory of automata, computability theory and the theory of computational complexity

3. It is considered the creation of models of all kinds in the field of computer science, and used the mathematics and logic.

4. Automata theory

   • Is the study of abstract machines and computational problems that can be solved using these machines.

5. Computability theory

   • It is the question of the extent to which a problem has a solution in a computer

6. Formal Language Theory

   • It is a branch of mathematics dealing with the description of languages as a set of operations on an alphabet

7. Some pioneers of the theory of computation were Alonzo Church, Kurt Gödel, Alan Turing, Stephen Kleene star, John von Neumann and Claude Shannon.

8. Models of computation

   • Lambda calculus, Combinatory logic, Markov algorithm, Register machine