A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Hypercomputation by definition

2004
*
Theoretical Computer Science
*

Hypercomputation refers to computation surpassing the Turing model, not just exceeding the von Neumann architecture. Algebraic constructions yield a ÿnitely based pseudorecursive equational theory (Internat. J. Algebra Comput. 6 (1996) 457-510). It is not recursive, although for each given number n, its equations in n variables form a recursive set. Hypercomputation is therefore required for an algorithmic answer to the membership problem of such a theory. Yet Alfred Tarski declared these

doi:10.1016/j.tcs.2003.12.011
fatcat:d3faa6rvkrf2nj3bhywab3nr54