# Exploring Computer Technology

# FizzQuiz Thu 5 Oct. 2017

Write your name and answer at least one of the questions below. 
Then save this file with your answer and submit as an attachment via email to
msantos@dragonacademy.org

## Questions

1. True of False? 
      a) (7>9)
      b) (NOT (2>=3))
      c) ( (7>9) OR (NOT 1>=1) )
      d) (NOT (2>=3) AND ( (7>9) OR (NOT 1>=1) )


2. What follows are the Transition Rules of a Turing Machine and the initial state and input. 
     Apply the rules one at a time till the machine halts, writing each time the content of the
     tape on a line below the previous one and writing on the left of each line, the current state
     of the machine (exactly as we have done in class)

     (A, 1) -> (0,C1,<)

     (A, 0) -> (0,C0,<)

     (C1,0) -> (1,F,>)

     (C0,0) -> (0,F,>)

     (F,X)  -> (X,A,>)

     
     A  0  1. 1  E