Hypercomputation by definition

@article{Wells2004HypercomputationBD,
  title={Hypercomputation by definition},
  author={Benjamin Wells},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={317},
  pages={191-207}
}
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… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

A Brief Critique of Pure Hypercomputation

  • Minds and Machines
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND

The case for hypercomputation

  • Applied Mathematics and Computation
  • 2006
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 40 REFERENCES

Is there a nonrecursive decidable equational theory

B. Wells
  • Minds Mach
  • 2002
VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Hypercomputation by de$nition

B. Wells
  • Abs. Amer. Math. Soc
  • 2003
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

In nite time Turing machines

VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Abstracting and generalizing pseudorecursiveness, Algebra Universalis, special issue on the Internat

B. Wells
  • Conf. on Modern Algebra Honoring the 60th Birthday of Ralph McKenzie,
  • 2002
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…