Turing Complete

• If you can make an FSA and
• if you can make an infinite tape,
• your system is Turing complete.
• So, anything you can program in java, I can theoretically program in neurons.
• Emma Byrne and I proved this in a paper, but we used programming theory.
• You need loops, conditionals, and sequence.
• It turns out, that's all you need to program.