Ist Malbolge Turing-vollständig?
-
Ist Malbolge Turing-vollständig?
-
Turing-completeness also requires three code constructs: sequential
execution (which Malbolge obviously has), repetition (provided by the
i and, indirectly, j instructions), and conditional-execution (provided,
I believe, by self-modifying code and altering i destinations).