Hypercomputation

Ord, T. (2002). Hypercomputation: computing more than the Turing machine.

Type

Unclassified

Intellectual base

Unclassified

Year

2002

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Unbounded nondeterminism
  • … constitutive identity and a convenient observable transfers from A fair arbiter eventually serves every request, yet no fixed number of intervening grants bounds how long one requester may wait. to A denotational model distinguishes guaranteed eventual completion from the absence of a uniform completion-time bound..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:33dff22a5220 · see in the full table