02.03.26.md (339B)
1 # 02/03/26 2 3 ## Turing machines 4 5 - have a fixed set of possible internal states 6 - have a defined starting state 7 - have a finite alphabet of symbols that can be stored in memory, including a blank character 8 - have a finite input alphabet of symbols, that start and end with blank charters 9 - unused memory must be set to the blank character 10