# data[].attributes.body
Another Computerphile video, this time using Python to explain the concept of the Halting Problem

# data[].attributes.attachment_link.title
Halting Problem in Python - Computerphile

# data[].attributes.body
This article introduces the idea of a Universal Turing Machine, which can be defined as:

> A Turing Machine that can execute the behaviour of any other Turing Machine

OR EVENT BETTER

> A UTM, U, is an interpreter that reads the description <m> of any arbitrary Turing Machine M; and faithfully executes operations on data D precisely as M does; the description <M> is written at the beginning of the tape, followed by D.

# data[].attributes.body
Here is a great resource from the University of Cambridge, which explains the Turing Machine concepts and then elaborates on how you might use a RaspberryPi to create one.

# data[].attributes.attachment_link.title
Computer Laboratory - Raspberry Pi: Introduction: What is a Turing machine?

# data[].attributes.attachment_link.description
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.

# data[].attributes.body
The Halting problem can be used to prove that some functions cannot be computed. This video although VERY annoying explains this as well as it can be explained. This is a concept that requires you to apply a deep understanding in order to gain knowledge on this topic. If you don't get it from this video then try and see if this one helps: https://goo.gl/8HSpx3

# data[].attributes.attachment_link.description
Part two of a two-part video on a famous theoretical result in computer science: The Halting Problem. Cypherus is voiced by YouTuber 1GOD1JESUS - subscribe to his channel (or BURN!) http://www.youtube.com/1GOD1JESUS (not safe for work - VERY VERY not safe!)

# data[].attributes.body
This webpage explains the components of a Turing Machine, gives some useful diagrams and then explains the point of them.

# data[].attributes.body
δ (Current State, Input Symbol) = (Next State, Output Symbol, Movement)

e.g.
δ(S0, _ ) = (SH, 1, R)
δ(S0, 0 ) = (S0, 0, R)
δ(S0, 1 ) = (S1, 1, R)
δ(S1, _ ) = (SH, 0, R)
δ(S1, 0 ) = (S1, 0, R)
δ(S1, 1 ) = (S0, 1, R)

The above are the transition rules for an odd parity generator.

# data[].attributes.body
This detailed written tutorial introduces Turing Machines as well as outlining the formal definition for a Turing Machine:

# data[].attributes.attachment_link.description
Turing Machine Introduction - Learn Automata concepts in simple and easy steps starting from Introduction, Deterministic Finite Automata, Non-Deterministic Finite Automata, NDFA to DFA Conversion, DFA Minimization, Moore and Mealy Machines, Introduction to Grammars, Language Generated by Grammars, Chomsky Grammar Classification, Regular Expressions, Regular Sets, Arden's Theorem, Constructing FA from

# data[].attributes.body
This document goes into great detail how the transition functions are defined and how failed computations are managed

# data[].attributes.body
You could use this resource to revise definitions of the keywords associated with Turing Machines

# data[].attributes.attachment_link.title
Learn AQA AS/A2 Computer Science and much more on Memrise

# data[].attributes.attachment_link.description
This course is designed for aiding students taking the AQA AS/A2 Computer Science course Starting in 2015, with the first A2 exams in 2017. More sections to be added in following months. Message me if you want to notify me of any errors found in the course.

# data[].attributes.body
The Turing Machine is a theoretical/ abstract model / a concept to determine what problems are computable.

The Turing Machine is a Finite State Machine (FSM)  that has an infinite memory/storage.

Every Turing Machine needs to be represented with:

A Start State

A Halting State

An Alphabet (usually 0,1,space)

Movement (the read/write head)

A Transition Function (what should be written at each cell and whether to move left or right)

# data[].attributes.body
This guy has made one so take a look

# data[].attributes.body
Another video to explain the Turing Machine

# data[].attributes.attachment_link.title
Turing Machines Explained - Computerphile

# data[].attributes.body
This video explains the Busy Beaver problem and how a Turing Machine is used to prove that this is an unsolvable problem

# data[].attributes.attachment_link.title
Busy Beaver Turing Machines - Computerphile

# data[].attributes.attachment_link.description
The Busy Beaver game, pointless? Or a lesson in the problems of computability? - How do you decide if something can be computed or not? Professor Brailsford's code and further reading: http://bit.ly/busybeaver Turing Machine Primer: http://youtu.be/DILF8usqp7M Busy Beaver Code: http://youtu.be/ZiTeuZSDB0U Ackermann Follow Up: http://youtu.be/uNACwX-O5lk Original 'Ackermann' Film (Most Difficult Program to Compute): http://youtu.be/i7sm9dzFtEI http://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley.

# data[].attributes.body
Watch this video for a good explanation of a Turing Machine, which links in nicely to the 'Busy Beaver' problem (See Busy Beaver Video)

# data[].attributes.attachment_link.description
This Primer is to accompany the 'Busy Beaver Turing Machines' film which can be viewed here: http://youtu.be/CE8UhcyJS0I Professor Brailsford's code and further reading: http://bit.ly/busybeaver Turing and the Halting Problem: http://youtu.be/macM_MtS_w4 Busy Beaver Turing Machines: http://youtu.be/CE8UhcyJS0I Domino Addition - Numberphile: http://youtu.be/lNuPy-r1GuQ Ackermann Follow Up: http://youtu.be/uNACwX-O5lk 'Turing Machines Collection' Playlist: http://www.youtube.com/playlist?list=PLzH6n4zXuckrEzV0CB1xXbSdsP_a7VUoK "The Most Difficult Program to Compute?"

# data[].attributes.body
A Level AQA - Click here to download all of the Past Paper Questions from the AQA on Turing Machines