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
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 thesedoi:10.1016/s0304-3975(03)00638-8 fatcat:p5hy7ivycja6fpah3ouorspogq