# Hypercomputation by definition

@article{Wells2004HypercomputationBD, title={Hypercomputation by definition}, author={Benjamin Wells}, journal={Theor. Comput. Sci.}, year={2004}, volume={317}, pages={191-207} }

- Published in Theor. Comput. Sci. 2004
DOI:10.1016/j.tcs.2003.12.011

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

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## A Brief Critique of Pure Hypercomputation

VIEW 1 EXCERPT

CITES BACKGROUND

## The case for hypercomputation

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 40 REFERENCES

## Is there a nonrecursive decidable equational theory

VIEW 15 EXCERPTS

HIGHLY INFLUENTIAL

## Hypercomputation by de$nition

VIEW 12 EXCERPTS

HIGHLY INFLUENTIAL

## In nite time Turing machines

VIEW 15 EXCERPTS

HIGHLY INFLUENTIAL

## Pseudorecursive Varieties of Semigroups - I

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## The problem of integration in finite terms

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Pseudorecursive varieties and their implications for word problems

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Applying, extending, and specializing pseudorecursiveness

VIEW 3 EXCERPTS

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

VIEW 1 EXCERPT

#### Similar Papers

Loading similar papers…