Turing machines &
V Neumann architecture

Turing Machines

Structure

Tape/Memory

Infinite lenght

Infinite Cells

Characters
or symbols

Read/WriteHead

Read/Modify/Overread the tape

Over 1 cell

Function

Input:
The Tape

Process:
1.Read Head reads 1 cell at the time
2.Read Head follows rules
3.Depending on the rules rewrites or moves

Output:
Modified Tape

V Neumann Architecture

Function

Input

Process
Follows rules

Output

Structure

Ram

Contains all the data that
is being processed

Clock

Wire that turns on and off to
maintain sincronisation