SlideShare ist ein Scribd-Unternehmen logo
1 von 16
Downloaden Sie, um offline zu lesen
TURING MACHINES AND COMPLEXITY By Mr.Neelamani Samal
INTRODUCING TURING MACHINES ,[object Object],[object Object],[object Object]
THE TURING MACHINE MODEL a 1 a 2 … a i … a n B B … Finite control
  T uring Machine is represented by-   M=(Q,  ,τ,δ,q0,B,F), Where Q   is the finite state of states    a set of τ not including B, is the set of input symbols, τ  is the finite state of allowable tape symbols, δ  is the next move function, a mapping from  Q × τ to Q × τ  ×{L,R} Q 0   in Q is the start state, B  a symbol of  τ is the blank, F   is the set of final states.  Representation of Turing Machine
TYPES OF TURING MACHINES ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
SIMULATION Theorem- If L is accepted by a two dimensional TM M 2  L is accepted by a one dimensional TM M 1 *BBB a 1 BBB*BB a 2  a 3  a 4  a 5 B* a 6  a 7 a 8 a 9 B a 10 B* a 11  a 12  a 13 B a 14  a 15 *BB a 16  a 17  BBB** simulation of two dimensions by a)Two-dimensional tape b)One dimensional simulation B B B a 1 B B B B B a 2 a 3 a 4 a 5 B a 6 a 7 a 8 a 9 B a 10 B B a 11 a 12 a 13 B a 14 a 15 B B a 17 a 16 B B B
CHURCH’S HYPOTHESIS The assumption that the intuitive notion of  “computable function” can be identified with the class of partial recursive function is known as  church’s hypothesis  or the  church –Turing thesis   Example-Random Access Memory…..
… SIMULATION OF RAM BY TURING MACHINE Contd… Theorem- A Turing machine can simulate a RAM provided that the elementary RAM instructions can themselves be simulated by a TM. The tape looks like- #0*v 0 #1*v 1 #10*v 2 #………I*v i #…… Where v i  is the contents in binary, of the ith word.
Contd … COMPUTATIONAL COMPLEXITY   ,[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],COMPUTATIONAL COMPLEXITY contd.
RELATIONS AMONG COMPLEXITY MEASURES ,[object Object],[object Object],[object Object]
  TAPE COMPRESSION   Theorem- If L is accepted by S(n) space-bounded Turing machine with k storage tapes, then for any c>0, L is accepted by a cS(n) space bounded TM. Corollary- If L is in NSPACE(S(n)), then L is in NSPACE(cS(n)), where c is any constant greater than zero.
    LINEAR SPEED UP   Theorem- If L is accepted by a k-tape T(n) time bounded Turing machine M 1 , then L is accepted by a k-tape cT(n) time-bounded TM M 2  for any c>0, provided that k>1 and inf n->∞ T(n)/ n->∞. Corollary-  If inf n->∞ T(n)/ n=∞. And c>0, then DTIME(T(n))=DTIME(cT(n)).
    THE UNION THEOREM Theorem-   Let {f i (n)|i=1,2,.................} be a recursively enumerable collection of recursive functions. That is there is a TM that enumerates a list of TM’s, the first computing f 1  , the second computing f 2  and so on. Also assume that for each i and n, f i (n)<f i+1 (n). Then there exists a recursive S(n) such that DSPACE(S(n))=U i>1  DSPACE(f i (n)).
CONCLUSION ,[object Object]
THANK YOU !!

Weitere ähnliche Inhalte

Was ist angesagt?

Turing Machine
Turing MachineTuring Machine
Turing MachineAyAn KhAn
 
Pushdown Automata Theory
Pushdown Automata TheoryPushdown Automata Theory
Pushdown Automata TheorySaifur Rahman
 
Turing machine Introduction
Turing machine IntroductionTuring machine Introduction
Turing machine IntroductionAram Rafeq
 
Traveling salesman problem
Traveling salesman problemTraveling salesman problem
Traveling salesman problemMohamed Gad
 
Applications of Mealy & Moore Machine
Applications of  Mealy  & Moore Machine Applications of  Mealy  & Moore Machine
Applications of Mealy & Moore Machine SardarKashifKhan
 
Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)
Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)
Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)Mohammad Ilyas Malik
 
Variants of Turing Machine
Variants of Turing MachineVariants of Turing Machine
Variants of Turing MachineRajendran
 
Flow Network Talk
Flow Network TalkFlow Network Talk
Flow Network TalkImane Haf
 
Nondeterministic Finite Automata
Nondeterministic Finite AutomataNondeterministic Finite Automata
Nondeterministic Finite AutomataAdel Al-Ofairi
 

Was ist angesagt? (20)

Turing Machine
Turing MachineTuring Machine
Turing Machine
 
Turing machine
Turing machineTuring machine
Turing machine
 
Tsp is NP-Complete
Tsp is NP-CompleteTsp is NP-Complete
Tsp is NP-Complete
 
Turing machines
Turing machinesTuring machines
Turing machines
 
Pushdown Automata Theory
Pushdown Automata TheoryPushdown Automata Theory
Pushdown Automata Theory
 
Turing machine by_deep
Turing machine by_deepTuring machine by_deep
Turing machine by_deep
 
Turing machine
Turing machineTuring machine
Turing machine
 
Turing machine Introduction
Turing machine IntroductionTuring machine Introduction
Turing machine Introduction
 
Traveling salesman problem
Traveling salesman problemTraveling salesman problem
Traveling salesman problem
 
Automata Theory - Turing machine
Automata Theory - Turing machineAutomata Theory - Turing machine
Automata Theory - Turing machine
 
Applications of Mealy & Moore Machine
Applications of  Mealy  & Moore Machine Applications of  Mealy  & Moore Machine
Applications of Mealy & Moore Machine
 
Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)
Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)
Finite Automata: Deterministic And Non-deterministic Finite Automaton (DFA)
 
Branch and bound
Branch and boundBranch and bound
Branch and bound
 
2_4 Finite Automata.ppt
2_4 Finite Automata.ppt2_4 Finite Automata.ppt
2_4 Finite Automata.ppt
 
N Queens problem
N Queens problemN Queens problem
N Queens problem
 
Turing machine
Turing machineTuring machine
Turing machine
 
Variants of Turing Machine
Variants of Turing MachineVariants of Turing Machine
Variants of Turing Machine
 
Flow Network Talk
Flow Network TalkFlow Network Talk
Flow Network Talk
 
Push down automata
Push down automataPush down automata
Push down automata
 
Nondeterministic Finite Automata
Nondeterministic Finite AutomataNondeterministic Finite Automata
Nondeterministic Finite Automata
 

Ähnlich wie Turing machine

P-NP-and-the-Polynomial-Space.ppt
P-NP-and-the-Polynomial-Space.pptP-NP-and-the-Polynomial-Space.ppt
P-NP-and-the-Polynomial-Space.pptHetansheeShah2
 
Fractal dimension versus Computational Complexity
Fractal dimension versus Computational ComplexityFractal dimension versus Computational Complexity
Fractal dimension versus Computational ComplexityHector Zenil
 
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...Hector Zenil
 
Time and space complexity
Time and space complexityTime and space complexity
Time and space complexityAnkit Katiyar
 
Introduction to complexity theory assignment
Introduction to complexity theory assignmentIntroduction to complexity theory assignment
Introduction to complexity theory assignmenttesfahunegn minwuyelet
 
Computational Complexity: Introduction-Turing Machines-Undecidability
Computational Complexity: Introduction-Turing Machines-UndecidabilityComputational Complexity: Introduction-Turing Machines-Undecidability
Computational Complexity: Introduction-Turing Machines-UndecidabilityAntonis Antonopoulos
 
Winter 8 TM.pptx
Winter 8 TM.pptxWinter 8 TM.pptx
Winter 8 TM.pptxHarisPrince
 
timecomplexity.ppt
timecomplexity.ppttimecomplexity.ppt
timecomplexity.pptssuser4293bd
 
Computational Complexity: Complexity Classes
Computational Complexity: Complexity ClassesComputational Complexity: Complexity Classes
Computational Complexity: Complexity ClassesAntonis Antonopoulos
 
Recurrent and Recursive Networks (Part 1)
Recurrent and Recursive Networks (Part 1)Recurrent and Recursive Networks (Part 1)
Recurrent and Recursive Networks (Part 1)sohaib_alam
 
2009 CSBB LAB 新生訓練
2009 CSBB LAB 新生訓練2009 CSBB LAB 新生訓練
2009 CSBB LAB 新生訓練Abner Huang
 
Marcov chains and simple queue ch 1
Marcov chains and simple queue ch 1Marcov chains and simple queue ch 1
Marcov chains and simple queue ch 1Guru Nathan
 
Joint blind calibration and time-delay estimation for multiband ranging
Joint blind calibration and time-delay estimation for multiband rangingJoint blind calibration and time-delay estimation for multiband ranging
Joint blind calibration and time-delay estimation for multiband rangingTarik Kazaz
 

Ähnlich wie Turing machine (20)

NP completeness
NP completenessNP completeness
NP completeness
 
P-NP-and-the-Polynomial-Space.ppt
P-NP-and-the-Polynomial-Space.pptP-NP-and-the-Polynomial-Space.ppt
P-NP-and-the-Polynomial-Space.ppt
 
Fractal dimension versus Computational Complexity
Fractal dimension versus Computational ComplexityFractal dimension versus Computational Complexity
Fractal dimension versus Computational Complexity
 
Unit 3
Unit 3Unit 3
Unit 3
 
Unit 3
Unit 3Unit 3
Unit 3
 
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small ...
 
Time and space complexity
Time and space complexityTime and space complexity
Time and space complexity
 
Introduction to complexity theory assignment
Introduction to complexity theory assignmentIntroduction to complexity theory assignment
Introduction to complexity theory assignment
 
Computational Complexity: Introduction-Turing Machines-Undecidability
Computational Complexity: Introduction-Turing Machines-UndecidabilityComputational Complexity: Introduction-Turing Machines-Undecidability
Computational Complexity: Introduction-Turing Machines-Undecidability
 
Winter 8 TM.pptx
Winter 8 TM.pptxWinter 8 TM.pptx
Winter 8 TM.pptx
 
timecomplexity.ppt
timecomplexity.ppttimecomplexity.ppt
timecomplexity.ppt
 
Turing machines
Turing machinesTuring machines
Turing machines
 
NP-Completeness - II
NP-Completeness - IINP-Completeness - II
NP-Completeness - II
 
Computational Complexity: Complexity Classes
Computational Complexity: Complexity ClassesComputational Complexity: Complexity Classes
Computational Complexity: Complexity Classes
 
class16.ppt
class16.pptclass16.ppt
class16.ppt
 
Recurrent and Recursive Networks (Part 1)
Recurrent and Recursive Networks (Part 1)Recurrent and Recursive Networks (Part 1)
Recurrent and Recursive Networks (Part 1)
 
OT
OTOT
OT
 
2009 CSBB LAB 新生訓練
2009 CSBB LAB 新生訓練2009 CSBB LAB 新生訓練
2009 CSBB LAB 新生訓練
 
Marcov chains and simple queue ch 1
Marcov chains and simple queue ch 1Marcov chains and simple queue ch 1
Marcov chains and simple queue ch 1
 
Joint blind calibration and time-delay estimation for multiband ranging
Joint blind calibration and time-delay estimation for multiband rangingJoint blind calibration and time-delay estimation for multiband ranging
Joint blind calibration and time-delay estimation for multiband ranging
 

Mehr von Neelamani Samal

Fault Tolerance token Based Algorithm
Fault Tolerance token Based AlgorithmFault Tolerance token Based Algorithm
Fault Tolerance token Based AlgorithmNeelamani Samal
 
Os scheduling Algorithms
Os scheduling AlgorithmsOs scheduling Algorithms
Os scheduling AlgorithmsNeelamani Samal
 
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...Neelamani Samal
 
computer architecture lab manual
computer architecture lab manualcomputer architecture lab manual
computer architecture lab manualNeelamani Samal
 
Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012Neelamani Samal
 
Software Engineering Lab Manual
Software Engineering Lab ManualSoftware Engineering Lab Manual
Software Engineering Lab ManualNeelamani Samal
 
Software engineering note
Software engineering noteSoftware engineering note
Software engineering noteNeelamani Samal
 
Lamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusionLamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusionNeelamani Samal
 
How to install windows Xp sp2
How to install windows Xp sp2How to install windows Xp sp2
How to install windows Xp sp2Neelamani Samal
 
Game Playing In A I Final
Game  Playing In  A I  FinalGame  Playing In  A I  Final
Game Playing In A I FinalNeelamani Samal
 

Mehr von Neelamani Samal (16)

Fault Tolerance token Based Algorithm
Fault Tolerance token Based AlgorithmFault Tolerance token Based Algorithm
Fault Tolerance token Based Algorithm
 
Os scheduling Algorithms
Os scheduling AlgorithmsOs scheduling Algorithms
Os scheduling Algorithms
 
RTS Question Paper 2012
RTS Question Paper 2012RTS Question Paper 2012
RTS Question Paper 2012
 
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
 
Os lab manual
Os lab manualOs lab manual
Os lab manual
 
computer architecture lab manual
computer architecture lab manualcomputer architecture lab manual
computer architecture lab manual
 
Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012
 
Software Engineering Lab Manual
Software Engineering Lab ManualSoftware Engineering Lab Manual
Software Engineering Lab Manual
 
Software engineering note
Software engineering noteSoftware engineering note
Software engineering note
 
Values oflife
Values oflifeValues oflife
Values oflife
 
Attitute
AttituteAttitute
Attitute
 
Cd writning technology
Cd writning technologyCd writning technology
Cd writning technology
 
Lamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusionLamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusion
 
How to install windows Xp sp2
How to install windows Xp sp2How to install windows Xp sp2
How to install windows Xp sp2
 
Game Playing In A I Final
Game  Playing In  A I  FinalGame  Playing In  A I  Final
Game Playing In A I Final
 
Computer Brain Power
Computer Brain PowerComputer Brain Power
Computer Brain Power
 

Kürzlich hochgeladen

IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfDaniel Santiago Silva Capera
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarPrecisely
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1DianaGray10
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-pyJamie (Taka) Wang
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IES VE
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024D Cloud Solutions
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDELiveplex
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsSafe Software
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Commit University
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfDianaGray10
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfJamie (Taka) Wang
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding TeamAdam Moalla
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URLRuncy Oommen
 

Kürzlich hochgeladen (20)

IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity Webinar
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-py
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
20150722 - AGV
20150722 - AGV20150722 - AGV
20150722 - AGV
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URL
 

Turing machine

  • 1. TURING MACHINES AND COMPLEXITY By Mr.Neelamani Samal
  • 2.
  • 3. THE TURING MACHINE MODEL a 1 a 2 … a i … a n B B … Finite control
  • 4. T uring Machine is represented by- M=(Q,  ,τ,δ,q0,B,F), Where Q is the finite state of states  a set of τ not including B, is the set of input symbols, τ is the finite state of allowable tape symbols, δ is the next move function, a mapping from Q × τ to Q × τ ×{L,R} Q 0 in Q is the start state, B a symbol of τ is the blank, F is the set of final states. Representation of Turing Machine
  • 5.
  • 6. SIMULATION Theorem- If L is accepted by a two dimensional TM M 2 L is accepted by a one dimensional TM M 1 *BBB a 1 BBB*BB a 2 a 3 a 4 a 5 B* a 6 a 7 a 8 a 9 B a 10 B* a 11 a 12 a 13 B a 14 a 15 *BB a 16 a 17 BBB** simulation of two dimensions by a)Two-dimensional tape b)One dimensional simulation B B B a 1 B B B B B a 2 a 3 a 4 a 5 B a 6 a 7 a 8 a 9 B a 10 B B a 11 a 12 a 13 B a 14 a 15 B B a 17 a 16 B B B
  • 7. CHURCH’S HYPOTHESIS The assumption that the intuitive notion of “computable function” can be identified with the class of partial recursive function is known as church’s hypothesis or the church –Turing thesis Example-Random Access Memory…..
  • 8. … SIMULATION OF RAM BY TURING MACHINE Contd… Theorem- A Turing machine can simulate a RAM provided that the elementary RAM instructions can themselves be simulated by a TM. The tape looks like- #0*v 0 #1*v 1 #10*v 2 #………I*v i #…… Where v i is the contents in binary, of the ith word.
  • 9.
  • 10.
  • 11.
  • 12.   TAPE COMPRESSION Theorem- If L is accepted by S(n) space-bounded Turing machine with k storage tapes, then for any c>0, L is accepted by a cS(n) space bounded TM. Corollary- If L is in NSPACE(S(n)), then L is in NSPACE(cS(n)), where c is any constant greater than zero.
  • 13.     LINEAR SPEED UP Theorem- If L is accepted by a k-tape T(n) time bounded Turing machine M 1 , then L is accepted by a k-tape cT(n) time-bounded TM M 2 for any c>0, provided that k>1 and inf n->∞ T(n)/ n->∞. Corollary- If inf n->∞ T(n)/ n=∞. And c>0, then DTIME(T(n))=DTIME(cT(n)).
  • 14.     THE UNION THEOREM Theorem- Let {f i (n)|i=1,2,.................} be a recursively enumerable collection of recursive functions. That is there is a TM that enumerates a list of TM’s, the first computing f 1 , the second computing f 2 and so on. Also assume that for each i and n, f i (n)<f i+1 (n). Then there exists a recursive S(n) such that DSPACE(S(n))=U i>1 DSPACE(f i (n)).
  • 15.