=====discrete Keyword 3=====
Turing machine

====Definition====
A Turing machine processes symbols on a strip of tape with a set of rules.  A Turing machine is not really meant for practical use but more to help computer scientists understand the limits of mechanical computation.  A hypothetical device to represent a computing machine.      
 
====References====
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).

  * http://en.wikipedia.org/wiki/Tree_traversal


=====discrete Keyword 3 Phase 2=====
push down automaton
====Definition====
Similar to a stack machine.  There is a virtual stack machine that was shown to me by Presley in the form of a spark machine.  The bios has a "stack machine"built in.  Basically a stack machine can only access and work with the top value of the stack.  

====References====


  * Presley 
  * http://en.wikipedia.org/wiki/Stack_machine
 
====Demonstration====
Demonstration of the indicated keyword.

Take a look at the spark machine in the back of the room using open firmware fourth interpreter.


ok 5 5 8 9 7
ok .s
5 5 8 9 7
ok

This is an example of the command line showing pushing numbers on the stack and then displaying them.

ok 5 5 + .d
10
ok

that for example is pushing two numbers on the stack adding them and then displaying the result.