Talk:Ultimate bf instruction minimalization!
Jump to navigation
Jump to search
I think it has 3 instructions, because NO OPERATION is also one of them --Zzo38 00:37, 9 January 2010 (UTC)
You're probably right :( Wh1teWolf 16:26, 11 January 2010 (UTC)
No-Op could be removed by having each half of all possible bytes correspond to a command. The most obvious way would be parity, but if I've got seven extra bits I'd like to at least use them for redundancy. --MDude 23:03, 21 July 2011 (UTC)
- The reference implementation seems to have halting command
!, so four commands if you count NOP, isn't it? --YamTokTpaFa (talk) 08:36, 19 August 2021 (UTC)
Turing-completness
Is it really Turing-complete? If yes, then there's need to be proof for that. --ChuckEsoteric08 (talk) 13:02, 5 July 2022 (UTC)
- ill delete the category since no answer has been given