Scribd
Upload
3 views

Unit-VIb DecidabilityUndecidabilityPCPCellular Automata

Uploaded by

Sparsh Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
3 views

Unit-VIb DecidabilityUndecidabilityPCPCellular Automata

Uploaded by

Sparsh Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 25

Decidability and

Recursively Enumerable
Languages
DEFINITION OF AN ALGORITHM
An algorithm as a procedure (finite sequence of instructions which
can be mechanically carried out) that terminates after a finite
number of steps for any input.
DECIDABILITY
If there exist any algorithm that takes as input an instance of
the problem and determines whether the answer to that
instance is yes or no then the problem is called decidable.
DECIDABLE LANGUAGES
UNDECIDABLE LANGUAGES
HALTING PROBLEM OF TURING
MACHINE
The halting problem of turing machine can be defined as:
Given an input string S and a Turing Machine T, can we tell
whether turing machine T halts on input string S or not?

Reducibility:
THE POST CORRESPONDENCE
PROBLEM
EXAMPLE
EXAMPLE
EXAMPLE
Computability
Computability is the ability to solve a problem in an effective manner.

It is a key topic of the field of computability


theory within mathematical logic and the theory of computation
within computer science.
The computability of a problem is closely linked to the existence of
an algorithm to solve the problem.

The most widely-studied models of computability are the Turing-


computable and μ-recursive functions, and the lambda calculus, all of
which have computationally equivalent power.
Cellular automaton
A cellular automaton is a discrete model studied in computability
theory, mathematics, physics, complexity science, theoretical
biology and microstructure modeling.

Cellular automata are also called cellular spaces, homogeneous


structures, cellular structures.

A cellular automaton consists of a regular grid of cells, each in one of


a finite number of states, such as on and off.

The grid can be in any finite number of dimensions. For each cell, a
set of cells called its neighborhood(usually including the cell itself) is
defined relative to the specified cell.
Classification
Defined four classes into which cellular automata and several other simple
computational models can be divided depending on their behavior.
In order of complexity the classes are:
Class 1: Nearly all initial patterns evolve quickly into a stable,
homogeneous state. Any randomness in the initial pattern disappears.

Class 2: Nearly all initial patterns evolve quickly into stable or


oscillating structures. Some of the randomness in the initial pattern
may filter out, but some remains. Local changes to the initial pattern
tend to remain local.

Class 3: Nearly all initial patterns evolve in a pseudo-random or chaotic


manner. Any stable structures that appear are quickly destroyed by
the surrounding noise. Local changes to the initial pattern tend to
spread indefinitely.

Class 4: Nearly all initial patterns evolve into structures that interact in
complex and interesting ways, with the formation of local structures
that are able to survive for long periods of time.
Primitive recursive function
The primitive recursive functions are defined using
primitive recursion and composition as central operations and are a
strict subset of the total µ-recursive functions (µ-recursive functions
are also called partial recursive).

INITIAL FUNCTIONS:
PRIMITIVE RECURSIVE FUNCTIONS OVER N
Computational complexity theory
In general usage, complexity tends to be used to characterize
something with many parts in intricate arrangement.

Computational complexity theory is a branch of the theory of


computation in theoretical computer
science and mathematics that focuses on classifying computational
problems according to their inherent difficulty, and relating
those classes to each other.

A computational problem is understood to be a task that is in


principle amenable to being solved by a computer, which is
equivalent to stating that the problem may be solved by
mechanical application of mathematical steps.
The best, worst and average case complexity refer to three
different ways of measuring the time complexity of different inputs
of the same size. Since some inputs of size n may be faster to solve
than others, we define the following complexities:

•Best-case complexity: This is the complexity of solving the


problem for the best input of size n.

•Worst-case complexity: This is the complexity of solving the


problem for the worst input of size n.

•Average-case complexity: This is the complexity of solving the


problem on an average.
• Time Complexity – The amount of time required to execute an
algorithm.

In computer science, the time complexity of


an algorithm quantifies the amount of time taken by an
algorithm to run as a function of the length of
the string representing the input. The time complexity of an
algorithm is commonly expressed using big O notation, which
excludes coefficients and lower order terms.

• Space Complexity – The amount of memory required to execute


an algorithm.
P (complexity):

In computational complexity theory, P, also known


as PTIME or DTIME, is one of the most fundamental complexity
classes. It contains all decision problems which can be solved by
a deterministic Turing machine using a polynomial amount
of computation time, or polynomial time.

NP (complexity):
In computational complexity theory, NP is one of the most
fundamental complexity classes. The abbreviation NP refers to
"nondeterministic polynomial time."

You might also like