Turing Complete
- Since you can do a stack, and for that matter two stacks,
and FSAs, you should be Turing Complete.
- That is, given any program, a net of sufficient size with
CAs can implement that program.
- Emma Byrne and I wrote a paper showing that it could be
done with selection, sequence and iteration.
- Sequence works like an FSA, with no input.
- Selection is done by two choose one.
- Iteration is done by selection and sequence.
- This does raise the question of post-hoc or ad-hoc neuro-cognitive
models.
