Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Hypercomputation

Known as: Super Turing computation, Super-Turing, Super-turing computation 
Hypercomputation or super-Turing computation refers to models of computation that can provide outputs that are not Turing computable. For example, a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We develop a model of computation as an unbounded process, measuring complexity by the number of observed behavioural changes… Expand
  • table 1
Is this relevant?
2007
2007
Wegner and Eberbach have argued that there are fundamental limitations to Turing Machines as a foundation of computability and… Expand
  • figure 1
  • figure 2
Is this relevant?
2005
2005
  • M. Stannett
  • Formal Aspects of Computing
  • 2005
  • Corpus ID: 7406983
We describe a novel machine model of computation, and prove that this model is capable of performing calculations beyond the… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is… Expand
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been considered, first as a… Expand
Is this relevant?
2004
2004
  • T. D. Kieu
  • Theor. Comput. Sci.
  • 2004
  • Corpus ID: 17562614
Despite the recursive non-computability of Hilbert's tenth problem, we outline and argue for a quantum algorithm that is based on… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
Abstract Some philosophers have conflated functionalism and computationalism. I reconstruct how this came about and uncover two… Expand
Is this relevant?
2003
2003
From the Publisher: This is the first book-length presentation and defense of a new theory of human and machine cognition… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • P. Welch
  • J. Symb. Log.
  • 2000
  • Corpus ID: 17859315
We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines. in terms of admissibility… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Abstract We explore the simulation and computational capabilities of discrete and continuous dynamical systems. We introduce and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?