We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Trainhooking
Trainhooking is Brainhooking but only ONE INSTRUCTION. its also made by User:Yayimhere. the change is: loop is gone and now the +(n) is +(n)[k] which will afterwards check if the cell is negative(after applying the command. if so then jump to line n. also it has only 2 cells now
Computational class
translation from Minsky machine(Short Minsky Machine Notation) to Trainhooking:
℘xy -> +(11)[x] ℘y -> +(01)[?] the ? can be anything
the pointer shifts between the first and second register. so if you want to increment first register without changing the second one:
+(01)[1] +(0)[1] +(01)[1]
Language is not Turing-complete since three register are needed for SMNN to be Turing-complete
is this the smallest BF minimilazation?
idk. i think so