chapter 8 theory of computation automata

© All Rights Reserved

0 views

chapter 8 theory of computation automata

© All Rights Reserved

- 10-2 Arithmetic Sequences and Series
- 12MSA1802_Surge_Logistic_InvestigationPartA.docx
- sdarticle
- AlgebraVocabList1
- NCERT Class 11 Mathematics Problems
- Cis
- 13737_04demo-dijkstra
- Complexity[1]
- PHYS 333 HW1
- Quiz 1
- Functions
- DS set 1
- relations and functions unit plan copy
- 151
- API_I_C7
- A First Course in Combinatorial Optimization Cambridge Texts in Applied Mathematics
- F4C1 Functions
- AppC
- ml
- 2.Pdfs Assembly Lecture

You are on page 1of 23

COMPUTABILITY AND

COMPLEXITY

Decidability

• When Turing Machine reaches at some final state it

“HALTS”.

• There are TMs that never halt on some inputs in any

state.

• So distinction between language can be made as:-

– TM that Halts on all input strings.

– Tm that never Halts on some input string.

Halting Problem of Turing Machine

Post Correspondence Problem

Computability

• The Problem of finding out whether a given

problem is “Solvable” by automata reduces to

the evaluation of function on the set of

natural numbers or a given alphabet by

mechanical means.

Primitive Recursion Function

• Consider the function exp(x, y) = xy

• x0 = 1

• x1 = x

• x2 = x . x

• … xy = x. x. x……( y occurences of x)

• xy+1 = x . x y

• The two Rewriting Rules:-

• X0 = 1

• Xy+1 = x. xy

x.0 = 0

X(y+1)= x + x . y

Converting exponential into multiplication or addition.

Or in general we can say complex functions into easy

functions.

• The primitive recursive functions are among the

number-theoretic functions, which are functions from

the natural numbers (nonnegative integers) {0, 1, 2, ...}

to the natural numbers. These functions take n

arguments for some natural number n and are called n-

ary.

• The basic primitive recursive functions are given by

these axioms:

• Constant function or Zero function: The 0-ary constant

function 0 is primitive recursive.

• Successor function: The 1-ary successor function S,

which returns the successor of its argument is

primitive recursive. That is, S(k) = k + 1.

• Projection function: For every n≥1 and each i with

1≤i≤n, the n-ary projection function Pin, which returns

its i-th argument, is primitive recursive.

Cellular of Automata and their Classes

• CA neighborhood is defined as an automaton and its

immediate neighbors. The two most common

neighborhood templates used for a two-dimensional

lattice are:

• Since the automata are using state configurations of a given

template as their input source, the set of all possible

configurations for a given template is isomorphic to the set of

input symbols that the automata need recognize.

conventions are universally employed:

• All FA use the same neighborhood template N .

• As a consequence of 1 and 2, all FA will be recognizing the

exact same set of state configurations. Thus, it its natural to

define all automata to use the same input symbol alphabet ∑.

• Typically, an FA's accepting states is ignored since the

goal of a cellular automaton is not to accept or reject

an input set, but to process an initial configuration of

start states.

• This leaves the last, arguably most important,

ingredient in a CA, the transition function.

Traditionally, the transition function is defined

identically for all FA.

• This effectively makes all FA in a cellular automaton

duplicates of an archetype FA. This criteria is known

as uniformity.

Cellular Automata Classes

• Class I From almost any initial configuration, cellular

automata evolve to a homogeneous state after a finite

number of time steps. Cellular automata in this class

exhibit the maximal possible order on both global and

local scales.

• Class II Cellular automata usually evolve to short

period structures. Local and global order is exhibited,

although not maximal.

• Class III Evolution of cellular automata from almost all

possible initial states leads to aperiodic patterns. After

sufficiently many time steps, the statistical properties

of these patterns are typically the same for almost all

initial configurations. Cellular automata in this class can

exhibit maximal disorder on both global and local

scales.

• Class IV Yields stable, periodic and propagating

structures which can persist over arbitrary lengths of

time. By properly arranging the propagating

structures, final states with any cycle length may be

obtained. The cellular automata in this class exhibit a

great deal of local order.

• For each CA class, Wolfram described the

behavior in terms of dynamical systems theory:

• [Class I]Cellular automata evolve to limit points.

• [Class II]Cellular automata evolve to limit cycles.

• [Class III]Cellular automata evolve to strange

attractors.

• [Class IV]Cellular automata exhibit very long

transient lengths, having no direct analogue in

the field of dynamical systems.

Complexity

• Time Complexity:- Amount of time taken by a

Machine to run input string.

• Space Complexity:- Amount of space or

memory required by machine to implement

input string.

The classes of P and NP problem

Power of Quantum Computation

- 10-2 Arithmetic Sequences and SeriesUploaded byUniQueShoshy
- 12MSA1802_Surge_Logistic_InvestigationPartA.docxUploaded byMohamed Mohsen
- sdarticleUploaded byMehdi Zangian
- AlgebraVocabList1Uploaded bythouartu
- NCERT Class 11 Mathematics ProblemsUploaded byraajeevms
- CisUploaded byAlex Wang
- 13737_04demo-dijkstraUploaded byMandeep Singh
- Complexity[1]Uploaded byAhsin Sadaqat Sulemani
- PHYS 333 HW1Uploaded byMT
- Quiz 1Uploaded byJohn Dale Evangelio
- FunctionsUploaded byFaZz Baa
- DS set 1Uploaded bySudhanshu Singh
- relations and functions unit plan copyUploaded byapi-311998112
- 151Uploaded byAleksis Kristian Marra
- API_I_C7Uploaded bymihai37
- A First Course in Combinatorial Optimization Cambridge Texts in Applied MathematicsUploaded byBernardo Herrera Ospitia
- F4C1 FunctionsUploaded byTee Pei Leng
- AppCUploaded byMarwan Ahmed
- mlUploaded byniraka
- 2.Pdfs Assembly LectureUploaded byShivanshu Trivedi
- Complexity-Classes Reductions.pdfUploaded byp_simi20039558
- lesson idea nameUploaded byapi-361246102
- lesson plan 2 fiunctionsUploaded byapi-300252239
- The Theory of Normal SurfacesUploaded byNill Berrocal Redolfo
- Presentation_Evac.pdfUploaded byBinh Nguyen Huy
- Church–Turing ThesisUploaded byfdhjyhdyhdyhr
- Cost FuncionUploaded byCristhian Calle
- Alt 09 ExtendedUploaded byKevin Mondragon
- alg1sec5-2.pptxUploaded bysaturnino corpuz
- 2019 g10 End of Term 2 AddmaUploaded byTahpehs Phiri

- 15856 NormalizationUploaded bySheeraz Ahmad
- 14085 Ch 4 Regular GrammarUploaded bySheeraz Ahmad
- lpu question papers cse322 automataUploaded bySheeraz Ahmad
- Statistics for Management.pdfUploaded byHarshith
- 17827_ECO111 Home Work 2Uploaded bySheeraz Ahmad
- EceUploaded bySunnyArora
- Nanomaterial in ArchitectureUploaded bySheeraz Ahmad
- Bcr-Abl Revise UiUploaded bySheeraz Ahmad
- Albert Cocco: the law of elasticityUploaded byRajat Yadav Yaduvanshi
- VPCCB17FXB_mkspUploaded bySheeraz Ahmad
- convex fuzzy setUploaded bySheeraz Ahmad
- Zx250Uploaded bySheeraz Ahmad
- Royal Enfield 2010 Thunderbird TwinsparkUploaded bySheeraz Ahmad
- 5aa32c79_TBTS_Tech_SpecUploaded byRajiv Nair
- 16473 CSE211 QuestionUploaded bySheeraz Ahmad
- 10-TSP-exam-solUploaded bySheeraz Ahmad
- 16022_test Gen SkillsUploaded bySheeraz Ahmad
- 14770_CountProUploaded bySheeraz Ahmad
- 14368_assigment2Uploaded bySheeraz Ahmad
- 18658_Classical Hollywood CinemaUploaded bySheeraz Ahmad
- InitiateSingleEntryPaymentSummary21-05-2015Uploaded bySheeraz Ahmad
- IP DATABASE MANAGEMENT SYSTEMUploaded byMohammadAnees
- Interfacing Traffic Light ControllerUploaded bySheeraz Ahmad

- 11 Recursive FunctionsUploaded bypisujo
- McAloon - Completeness Theorems, Incompleteness Theorems and Models of ArithmeticUploaded byTandahara
- The Primitive Recursive Functions Are Recursively EnumerableUploaded byMarcela Portela
- Theory of ComputationUploaded bythomasdevasia4u
- BlooP and FlooP and GlooPUploaded byJose Emmanuel Sainz
- A 4 SolutionsUploaded byrebv
- Module 1Uploaded byNaveen Jose
- Saul Kripke - Elementary Recursion Theory.pdfUploaded byRay Meza
- Ms Primitive RecursiveUploaded bymansha99
- Theory of Computation Lecture Notes - Abhijat VichareUploaded byAbhi Mediratta
- Recursive FunctionsUploaded byGledsonLeal
- Complexity Lecture NotesUploaded byAnik Mukherjee
- Graph of Ackermann-Function is PrUploaded bygodwsky
- Artemov - 2001 - Explicit Provability and Constructive SemanticsUploaded byAbram Demski
- 23-1-11Uploaded byMurali Krishna
- Gödel's Incompleteness Theorem Proof Short VersionUploaded byNikothePanda
- Recursive FunctionsUploaded byapi-3864917
- Problemset1 Ph340 SolutionsUploaded byLanre Jonathan Ige
- 16Uploaded byvictorCDXX
- TocUploaded byTanbir Khan
- Douglas Hofstadter - Godel Escher Bach Chapter 13a BlooP Anf FlooP and GlooPUploaded byIgor Bojceski
- A Fundamental Flaw In Smith's Incompleteness Proof In The Book “An Introduction To Gödel’s Theorems"Uploaded byJames R Meyer
- The Primitive Recursive FunctionsUploaded byWaldo Gómez Alvarez
- Mathematical Notation of SetsUploaded bySatheeshRajuKalidhindi
- Primitive Recursive FunctionsUploaded byEJL
- 10.1.1.133Uploaded byRaj Bhati
- Douglas Hofstadter - Godel Escher Bach Chapter 15a Jumping Out of the SystemUploaded byIgor Bojceski

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.