PL583: Turing Machine Half Adder Correction

This document addresses the correction of the Sout and Cout bits in the Turing machine half adder. It also highlights the role of the machine's internal states in determining subsequent actions of the Turing machine.

PL583: Turing Machine Half Adder Correction
George Nisbet
437 views • May 26, 2015
PL583: Turing Machine Half Adder Correction

About this video

Apologies for the Sout and Cout bits being the wrong way round.

Also note that the machine's internal states govern what the Turing machine will do next - analogous to an if/else statement in computer programming.

INSTRUCTIONS:

- Go to http://morphett.info/turing/turing.html
- Copy and paste the machine table below into the 'Turing Machine Program' box
- Set the initial state to P
- Set the initial input syntax to a 3 bit value, representing the A, B, and Cin bits respectively. eg: 101 for A=1, B=0, Cin=1
- Press 'reset'
- Run or step the program until it halts.

MACHINE PROGRAM START

P 0 _ r Q
P 1 _ r R

Q 0 0 r W
Q 1 1 r X

X 1 0 * halt
X 0 1 l Y

Y 1 0 * halt

W 1 1 * halt
W 0 0 * halt



R 1 1 r T
R 0 0 r U

U 1 0 l V
U 0 1 * halt

T 1 1 * halt
T 0 0 * halt

V 1 0 * halt
V 0 1 * halt

MACHINE PROGRAM END

Video Information

Views

437

Likes

3

Duration

1:48

Published

May 26, 2015

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.