superrecursive

/S UW1 P R AH0 K ER1 S IH0 V/
adjective
  1. 1

    (computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines.