For Brainfuck one could also define a Busy Beaver problem like the maximum number of steps before a given Brainfuck program stops. But you need to define what c

For Brainfuck one could also define a Busy Beaver problem like the maximum number of steps before a given Brainfuck program stops. But you need to define what counts as a step. I would say that executing a command from the program counts as one step, meaning that the interpretation of '[' does not count all the commands that are skipped when the current memory cell is 0.