Skip to main contentCal State San Bernardino
>> [CNS] >> [Comp Sci Dept] >> [R J Botting] >> [CS546/646] >> projects [Text Version]
[About] [Contact] [Grades] [Projects] [Submit] [Schedule] [Syllabus] [Search ]
Session: [01] [02] [03] [04] [05] [06]
Wed Apr 12 17:31:40 PDT 2006


    Project Turing Machine


    1. Working in a team of 3 or 4 people design, code, and test a Turing Machine simulator. You may use any language that can be demonstrated in class. You may choose any kind of user interface you like. Your TM simulator does not have to have infinite memory capacity like a real TM.


        Use Case 1: User can Run an example Turing Machine and run that

        Priority: Nice but not critical.

        However this is a useful firsst iteration leading to Use Case 2.

        Use Case 2: User inputs and runs ther own Turing Machine

        Priority: Critical, must do.

        Use Case 3: User can load, edit, test, and save a Turing Machine

        Priority: Low.


      . . . . . . . . . ( end of section Requirements) <<Contents | End>>


      Wed Apr 268Project kick off
      Mon May 19Half TimeInitial artifacts and demo prototype
      Mon May 811Final Score?Final artifacts & demo

    . . . . . . . . . ( end of section Project Turing Machine) <<Contents | End>>

    Standard Definitions

  1. FSA::="Finite State Acceptor/Automata", a theoretical machine with a finite set of states.
  2. ND::="Non-deterministic", a machine that can try out many possibilities and always guesses the right choice. Note: For a given problem a ND solution is simpler and easier to understand than a deterministic one. We study ND machines to discover how to use them as high-level designs for more complicated deterministic machines. Plus it's fun.
  3. PDA::="Push down Automata", a machine with a finite control and a single stack for remembering intermediate data. Kind of like half a TM.
  4. RJB::=The author of this document, [ ../index.html ]
  5. |-RJB="Richard J Botting, Comp Sci Dept, CSUSB".
  6. Schedule::= See
  7. Search::= See
  8. Syllabus::= See, and also see [ syllabus.html ] (my generic syllabus).
  9. TBA::="To Be Announced".
  10. TM::="Turing Machine".