Recent content by insectosaurus

  1. I

    Boolean expressions for Turing Machine

    i,j,k are not random variables
  2. I

    Boolean expressions for Turing Machine

    no, it's true if cell j contains symbol s_{k} at time i
  3. I

    Boolean expressions for Turing Machine

    no it's not, more precisely, 0 \leq k \leq |\Sigma | - 1, where \Sigma is the alphabet. so S[i,j,k] means at time i, the contents of tape square j is symbol s_{k} and 0 \leq i \leq p(n) and -p(n) \leq j \leq p(n) where n is input's length, lets say the input string is x, then x...
  4. I

    Boolean expressions for Turing Machine

    H and S are 2D and 3D arrays H[i,j] is TRUE if the read/write head at time i is scanning cell j, else FALSE S[i,j,k] has symbol k at time i in cell j
  5. I

    Boolean expressions for Turing Machine

    Hello, I want to express Non-Deterministic Turing Machine constraint with boolean expression. The constraint is: "Cells which aren’t being read remain the same at time t+1". lets say H[i,j] means the read/write head at time i at cell j and S[i,j,k] means the symbol k at time i in cell j so the...
Back
Top