Talk:Hanabi
Jump to navigation
Jump to search
on turing completeness do you think it is? im not really sure myself --Xff (talk) 20:08, 18 July 2024 (UTC)
- It's Turing-complete because nothing's forcing you to use the
.s to look at each other – you can surround all of them with#s to write arbitrary instructions in any order, letting you produce an arbitrary effect at an arbitrary point – and the command set is easily powerful enough for Turing-completeness (e.g. there is a stack rotate operation, plus the ability to push 0 and 1, and to pop and goto based on nonzeroness, which lets you implement a range of different queue automata, with cyclic tag being one of the simpler possibilities). --ais523 13:43, 19 July 2024 (UTC)