Scribd
Upload
19 views

Computer Theory

During the early 20th century, mathematicians like Godel, Turing, and Church discovered that some problems cannot be solved by computers, such as determining if a mathematical statement is true or false. This led to the development of theoretical computer models and complexity theory, which classifies problems as solvable or not solvable. Computability theory introduces concepts used in complexity theory. Automata theory deals with mathematical models of computation like finite automata and context-free grammars, which are used in areas like text processing and programming languages. It provides precise definitions of computers that are required for understanding computability and complexity theory.

Uploaded by

ceka ceka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Computer Theory

During the early 20th century, mathematicians like Godel, Turing, and Church discovered that some problems cannot be solved by computers, such as determining if a mathematical statement is true or false. This led to the development of theoretical computer models and complexity theory, which classifies problems as solvable or not solvable. Computability theory introduces concepts used in complexity theory. Automata theory deals with mathematical models of computation like finite automata and context-free grammars, which are used in areas like text processing and programming languages. It provides precise definitions of computers that are required for understanding computability and complexity theory.

Uploaded by

ceka ceka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

COMPUTABILITY THEORY

During the first half of the twentieth century, mathematicians such as Kurt
G¨odel, Alan Turing, and Alonzo Church discovered that certain basic problems
cannot be solved by computers. One example of this phenomenon is the problem
of determining whether a mathematical statement is true or false. This task
is the bread and butter of mathematicians. It seems like a natural for solution
by computer because it lies strictly within the realm of mathematics. But no
computer algorithm can perform this task.
Among the consequences of this profound result was the development of ideas
concerning theoretical models of computers that eventually would help lead to
the construction of actual computers.
The theories of computability and complexity are closely related. In complexity
theory, the objective is to classify problems as easy ones and hard ones;
whereas in computability theory, the classification of problems is by those that
are solvable and those that are not. Computability theory introduces several of
the concepts used in complexity theory.
AUTOMATA THEORY
Automata theory deals with the definitions and properties of mathematical models
of computation. Thesemodels play a role in several applied areas of computer
science. One model, called the finite automaton, is used in text processing, compilers,
and hardware design. Another model, called the context-free grammar, is
used in programming languages and artificial intelligence.
Automata theory is an excellent place to begin the study of the theory of
computation. The theories of computability and complexity require a precise
definition of a computer. Automata theory allows practice with formal definitions
of computation as it introduces concepts relevant to other nontheoretical areas
of computer science.

You might also like