Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,798,538 papers from all fields of science
Search
Sign In
Create Free Account
Hypercomputation
Known as:
Super Turing computation
, Super-Turing
, Super-turing computation
Expand
Hypercomputation or super-Turing computation refers to models of computation that can provide outputs that are not Turing computable. For example, a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
38 relations
Abstract machine
Advice (complexity)
Algorithm
Analog computer
Expand
Broader (1)
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Closed choice and a Uniform Low Basis Theorem
V. Brattka
,
Matthew de Brecht
,
A. Pauly
Annals of Pure and Applied Logic
2010
Corpus ID: 17940199
Highly Cited
2008
Highly Cited
2008
Hypercomputation: Computing Beyond the Church-Turing Barrier
Apostolos Syropoulos
2008
Corpus ID: 57640893
This book provides a thorough description of hypercomputation. It covers all attempts at devising conceptual hypermachines and…
Expand
2007
2007
Are There New Models of Computation? Reply to Wegner and Eberbach
P. Cockshott
,
G. Michaelson
Computer/law journal
2007
Corpus ID: 2465861
Wegner and Eberbach have argued that there are fundamental limitations to Turing Machines as a foundation of computability and…
Expand
Review
2004
Review
2004
Hypercomputation
B. Copeland
Minds and Machines
2004
Corpus ID: 218585685
A survey of the field of hypercomputation, including discussion of a variety of objections.
2004
2004
Functionalism, Computationalism, and Mental States
G. Piccinini
2004
Corpus ID: 2102925
Highly Cited
2004
Highly Cited
2004
Turing’s Ideas and Models of Computation
E. Eberbach
,
Dina Q. Goldin
,
P. Wegner
2004
Corpus ID: 7028778
The theory of computation that we have inherited from the 1960s focuses on algorithmic computation as embodied in the Turing…
Expand
Highly Cited
2004
Highly Cited
2004
Real recursive functions and their hierarchy
Jerzy Mycka
,
José Félix Costa
Journal of Complexity
2004
Corpus ID: 1525971
Highly Cited
2003
Highly Cited
2003
Physical Hypercomputation and the Church–Turing Thesis
Oron Shagrir
,
I. Pitowsky
Minds and Machines
2003
Corpus ID: 12788899
We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is…
Expand
Highly Cited
1998
Highly Cited
1998
Gado: a genetic algorithm for continuous design optimization
K. Rasheed
,
H. Hirsh
1998
Corpus ID: 60773665
OF THE DISSERTATION GADO: A Genetic Algorithm for Continuous Design Optimization by Khaled Mohamed Rasheed Dissertation Director…
Expand
Highly Cited
1996
Highly Cited
1996
On the Computational Power of Dynamical Systems and Hybrid Systems
Olivier Bournez
,
M. Cosnard
Theoretical Computer Science
1996
Corpus ID: 2263157
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE