This is much geekier than I usually post, but I found it very cute and interesting. Can your cat be a programmable computer? Perhaps. – Douglas
Peluche (meaning “plush” in French) is a smooth cat that somehow lives in my house.
She will be our test subject today.
Is Peluche Turing-complete?
What is Turing-completeness
Turing-completeness is the notion that if a device can emulate a Turing machine, then it can perform any kind of computation1.
It means that any machine that implements the eight following instructions is a computer (and can thus execute any kind of computation):
- . and ,: Inputting and outputting a value
- + and -: Increase and decrease the value contained in a memory cell2.
- > and <: Shift the current memory tape left or right.
- [ and ]: Performing loops.
So, if Peluche can perform these eight instructions, we can consider her Turing-complete.
Read Is my cat Turing-complete? via Belay the C++
An interesting link found among my daily reading