Scribd
Upload
37 views4 pages

Document (1) Com Architecture

Automata theory deals with abstract machines and complex computational problems. It studies machines that accept input strings and process them through a series of states. Computability theory is concerned with what problems can be solved by computers. A key conclusion is that the halting problem cannot be solved by a Turing machine. The Chomsky hierarchy categorizes formal languages into four types based on the rules used to generate strings. Computational complexity theory classifies problems based on the resources like time and storage required to solve them using different algorithms.

Uploaded by

jelloboy08
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
37 views4 pages

Document (1) Com Architecture

Automata theory deals with abstract machines and complex computational problems. It studies machines that accept input strings and process them through a series of states. Computability theory is concerned with what problems can be solved by computers. A key conclusion is that the halting problem cannot be solved by a Turing machine. The Chomsky hierarchy categorizes formal languages into four types based on the rules used to generate strings. Computational complexity theory classifies problems based on the resources like time and storage required to solve them using different algorithms.

Uploaded by

jelloboy08
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/ 4

Types of theory computation

1. Automata Theory

Automata Theory is a theoretical branch of Computer Science and mathematics


and deals with the study of complex computational problems and abstract
machines. The word Automata is derived from the word “Automaton” which is
closely related to the word “Automation”.

Automata are machines that accept a string as input and process it through a
finite number of states before reaching the end state. The primary objective for
creating automata theory was to create tools for describing and analysing the
dynamic behaviour of discrete systems.
2. Computability Theory
Computability theory, also known as Recursion Theory, is a branch of
Mathematics and Computer Science that is primarily concerned with the extent to
which an issue may be solved by a computer. It originated in the 1930s with the
study of computable functions and Turing degrees.

The statement that a Turing computer cannot solve the halting issue is one of the
most significant conclusions in computability theory because it is an example of a
concrete problem that is both straightforward to define and impossible to solve
with a Turing machine. The halting issue result serves as the foundation for most
of computability theory.

3.The Chomsky Hierarchy


A Formal language is a set of sequences or strings over some finite vocabulary
identified with words, morphemes or sounds. There are four types of languages in
the Chomsky Hierarchy:
4. Computational Complexity Theory

Computational Complexity Theory is that branch of Theory of Computation that


classifies computational problems according to their resource usage. These
computational problems are solved by different algorithms.

An issue is considered inherently complex if its solution necessitates


considerable resources, regardless of the method utilised. This intuition is
formalised by the theory, which introduces mathematical models of computing
to analyse these issues and measure their computational complexity, i.e., the
amount of resources required to solve them, such as time and storage.

You might also like