# Boolean expressions for Turing Machine

by insectosaurus
Tags: boolean, expressions, machine, turing
 P: 5 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 = s_{1} \cdot s_{2} \cdot ... \cdot s_{k} \cdot ...\cdot s_{n}$$
 P: 5 no, it's true if cell j contains symbol $$s_{k}$$ at time i