4 views

Uploaded by TanmaySardana

turing machine

- Programming 1 Week 2 Tutorials[1]
- Hw10f03 Sol Post
- Computer Standard II
- War Shall
- 12389
- Core Module Exercise > Core_QB14_eng
- mehnu
- Howto-tech Papers (3)
- Algorithm
- Spoj Tutorials Ciclos Feb 2014
- Solutions of systems of inequalities
- atn project rubric
- MICAI2015_EFIM_High_Utility_Itemset_Mining.pdf
- Programing in Visual Basic 2010 25
- Lecture 5
- Algorithm,Flowchart,Pseudocode
- Discovering Computers Chapter01
- Automated Essay Grading using Features Selection
- well
- Fixed Point Iteration

You are on page 1of 6

A Turing machine is a hypothetical machine thought of by the mathematician Alan Turing in 1936.

Despite its simplicity, the machine can simulate ANY computer algorithm, no matter how complicated

it is!

Above is a very simple representation of a Turing machine. It consists of an infinitely-long tape which

acts like the memory in a typical computer, or any other form of data storage. The squares on the tape

are usually blank at the start and can be written with symbols. In this case, the machine can only

process the symbols 0 and 1 and " " (blank), and is thus said to be a 3-symbol Turing machine.

At any one time, the machine has a head which is positioned over one of the squares on the tape.

With this head, the machine can perform three very basic operations:

1.

2.

3.

Move the tape left of right by one square so that the machine can read and edit the symbol on a

neighbouring square.

A simple demonstration

As a trivial example to demonstrate these operations, let's try printing the symbols "1 1 0" on an

initially blank tape:

A simple program

With the symbols "1 1 0" printed on the tape, let's attempt to convert the 1s to 0s and vice versa. This

is called bit inversion, since 1s and 0s are bits in binary. This can be done by passing the following

instructions to the Turing machine, utilising the machine's reading capabilities to decide its subsequent

operations on its own. These instructions make up a simple program.

Symbol read

Write instruction

Move instruction

Blank

None

None

Write 1

Write 0

The machine will first read the symbol under the head, write a new symbol accordingly, then move the

tape left or right as instructed, before repeating the read-write-move sequence again.

Let's see what this program does to our tape from the previous end point of the instructions:

The current symbol under the head is 0, so we write a 1 and move the tape right by one square.

The symbol being read is now 1, so we write a 0 and move the tape right by one square:

Finally, a 'blank' symbol is read, so the machine does nothing apart from read the blank symbol

continuously since we have instructed it to repeat the read-write-move sequence without stopping.

In fact, the program is incomplete. How does the machine repeat the sequence endlessly, and how

does the machine stop running the program? The program tells it to with the concept of a machine

state.

To complete the program, the state changes during the execution of the program on the machine must

be considered. The following changes, marked in italics, must be aded to our table which can now be

called a state table:

State

Symbol read

Write instruction

Move instruction

Next state

State 0

Blank

None

None

Stop state

Write 1

State 0

Write 0

State 0

We allocate the previous set of instructions to a machine state, so that the machine will perform those

instructions when it is in the specified state.

After every instruction, we also specify a state for the machine to transition to. In the example, the

machine is redirected back to its original state, State 0, to repeat the read-write-nove sequence,

unless a blank symbol is read. When the machine reads a blank symbol, the machine is directed to a

stop state and the program terminates.

Even though it seems silly to do so, let's now add an additional state to our program that reverts the

already inverted bits "1 1 0" back from "0 0 1" to "1 1 0". Below is the updated table, with changes

listed in italics. The Turing machine now acts like a finite state machine with two statesthese are

called three-symbol, two-state Turing machines.

State

Symbol read

Write instruction

Move instruction

Next state

State 0

Blank

Write blank

State 1

Write 1

State 1

Write 0

State 0

Blank

Write blank

Stop state

Write 1

State 1

Write 0

State 1

State 1

For the write instruction, "None" has been changed to "Write blank" for uniformity's sake (so that only

the machine's symbols are referred to), and it should be noted that they are equivalent.

Instead of a state table, the program can also be represented with a state diagram:

From where the program was previously, instead of doing nothing and stopping after the machine

encounters a blank symbol, we instruct it to move the tape left before transitioning to State 1 where it

reverses the bit inversion process.

Next, we invert the bits again, this time moving the tape left instead of right.

Finally, a blank symbol is read, so we move the tape right to get back to where we started, and stop

the program.

With the introduction of more states to our program, we can instruct the Turing machine to perform

more complex functions and hence run any algorithm that a modern day computer can.

- Programming 1 Week 2 Tutorials[1]Uploaded byAmaliah Cunningham
- Hw10f03 Sol PostUploaded byhey fucker
- Computer Standard IIUploaded byWork Ids
- War ShallUploaded byasiyanoor
- 12389Uploaded byAdamo Ghirardelli
- Core Module Exercise > Core_QB14_engUploaded byapi-3812894
- mehnuUploaded bysheoranl
- Howto-tech Papers (3)Uploaded byNizamuddin Ariffin
- AlgorithmUploaded byMuhd Bukhari
- Spoj Tutorials Ciclos Feb 2014Uploaded byShikha Sharma
- Solutions of systems of inequalitiesUploaded byNilam Doctor
- atn project rubricUploaded byapi-344568388
- MICAI2015_EFIM_High_Utility_Itemset_Mining.pdfUploaded byLoges Waran
- Programing in Visual Basic 2010 25Uploaded bymudassir2640
- Lecture 5Uploaded byHimaghna Dasgupta
- Algorithm,Flowchart,PseudocodeUploaded bysudhakarm13
- Discovering Computers Chapter01Uploaded byDang Kien Cuong
- Automated Essay Grading using Features SelectionUploaded byAnonymous kw8Yrp0R5r
- wellUploaded byMarcy Ledvinka
- Fixed Point IterationUploaded byRanko
- brandt quest6Uploaded byapi-278651557
- An Image Based PCB Fault Detection and Its ClassificationUploaded byEditor IJRITCC
- CS March 2016 Examination - FinalUploaded byRoshan Bc
- ITC Lect 06 [Algorithms Flowcharts Pseudocode-I]Uploaded bysayed Tamir jan
- البرمجة.pdfUploaded byAhmed Al-Baghdadi
- An Iterative MapReduce Based Frequent Subgraph Mining Algorithm.pdfUploaded byIEEEPROJECTSCHENNAI
- 1893514-AQA-MD02-QP-JUN13.pdfUploaded byastargroup
- Designing Freedom - by Stafford BeerUploaded byDaniel Naftalovich
- NCC P3Uploaded byNurul Azra Qutubuddin
- Background of Computer TheoryUploaded byIqra Javeed

- ApplicationformUploaded byTanmaySardana
- Print Outs tUploaded byTanmaySardana
- Test Project India Skill Week WSI 2018.Docx_1476801147591Uploaded byTanmaySardana
- 2 Introduction to XRPD Data Analysis.pptxUploaded byMuthu Kumar
- PPT - I (Unit-II) (1)Uploaded byTanmaySardana
- BCS AirAsia Island Transfer Project FSD v1.0Uploaded byTanmaySardana
- Solution Itinerary v1 0Uploaded byTanmaySardana
- Gps Lab - CopyUploaded byTanmaySardana
- Files 3-Handouts Lecture 16Uploaded byvishalnimbark
- Computational Physics Using MATLABUploaded byDini Fakhriza A
- Eco ProjectUploaded byTanmaySardana
- M1L3Uploaded bykorumillichandu
- Confirmation Letter 3Uploaded byTanmaySardana
- superfluidity and superconductivityUploaded byTanmaySardana
- PDF ResumeUploaded byTanmaySardana

- Analysis of Student Performance by Using Data Mining ConceptUploaded byEditor IJRITCC
- 228444 DhampirRace V1.1 BenjaminHuffmanUploaded byHeath Wannemacher
- Muscle Building Workouts- 23 Ways to Get Big and StrongUploaded byJM Gym Manticao
- hello ruby adventures in codingUploaded byapi-350095594
- 132150723 Huong Dan Nhanh Cau Hinh Switch Lightsmart v2224g Op 20120104Uploaded byHuỳnh Ngọc Thương
- Reference Pricing Service From Bondweb MalaysiaUploaded byMeor Amri
- E.T. the prequelUploaded bycohen33c
- Boef --- Beam on Elastic Foundation AnalysisUploaded byDavidParedes
- ReadmeUploaded byHenryque Alves
- Chapter 5 Light STUDENT'S MODULEUploaded byMohd Khairul Anuar
- Hum Drum ScoreUploaded byJulian Eduardo Garcia Peña
- Piracy at Sea.pdfUploaded byAnonymous sSR6x6VC8a
- Goldwing InstructionsUploaded byVanadia Nohan
- UFD3UX (3)Uploaded byfirdakusumaputri
- Cleanroom PresentationUploaded byjonh366
- 99-T038Uploaded byGowthamraj
- Printing MachinesUploaded byNeetek Sahay
- Biological MoleculesUploaded byneeti
- EVALUATION OF USE OF ULTRASOUND IMAGING IN SPINAL ANAESTHESIA IN PATIENTS WITH DIFFICULT SURFACE ANATOMICAL LANDMARKS.Uploaded byIJAR Journal
- Marley-AV-TS-10-LUploaded byEvi Mata
- Section8F Condulet® Seals, Breathers and DrainsUploaded bytasingenieria
- Jane's Electro-optic Systems 2006-2007Uploaded byAlexanderPetrov
- The 7 Principles of the Happiness AdvantageUploaded byRobert Christian Aguilar
- T CodesUploaded bybiswajit6864
- Interop Guide SwitchUploaded byPablo Aros Alcaino
- John Deere 850D LCUploaded byForomaquinas
- math 9 unit plan 7 - similarity and transformationsUploaded byapi-260661724
- Huawei Indoor Power Tp48300b-x6x0 Tp48600b-x6x0 User ManualUploaded byNguyen Van Nguyen
- Mendoza et al. 2010Uploaded byarmandosano
- GF ecoFIT System Brochure.pdfUploaded bySutama Mandala