Malbolge, with its 59049 memory locations that can each hold a ten-trit ternary number, as well as its counter-intuitive “crazy operation”, ternary arithmetics, and self-altering code, thereby consequently causing a beam search algorithm (designed by Andrew Cooke and implemented in Lisp) to take 2 years to write the first program in it:
