Abstract:

Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called "classical" hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider "non-classical" hypercomputation. This paper surveys those paradigms, and poses various non-classical hypercomputation questions.