Live briefing
Everything about Hypercomputation
Models of computation
Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that could solve the halting problem would be a hypercomputer; so too would one that could correctly evaluate every statement in Peano arithmetic. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: HypercomputationA 5-minute orientation
- Skim a recent paper: Fast and accurate control of gates for quantum hypercomputation based on coherent domains of waterInfluential work since 2022
- Pick up a classic book: SupermindsThe most-reprinted book on the subject
- Read the landmark paper: HypercomputationCited 108 times
- Go sideways: Quantum Turing machineA closely related topic
- Go sideways: ComputationA closely related topic
📖 Definitions
Noun Any of several forms of computation that are theoretically (or practically) impossible with current technology.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Hypercomputation
Physical Hypercomputation and the Church–Turing Thesis
Why there is no such discipline as hypercomputation
Hypercomputation and the Physical Church‐Turing Thesis
Hypercomputation: philosophical issues
The many forms of hypercomputation
Hypercomputation with quantum adiabatic processes
The case for hypercomputation
🆕 Influential since 2022
📚 Books worth reading
SupermindsSelmer Bringsjord, S. Bringsjord · 2003
HypercomputationApostolos Syropoulos · 2008
Unconventional Computation and Natural ComputationGiancarlo Mauri · 2013
At the edge of uncertaintyMichael Brooks · 2014
Membrane ComputingErzsébet Csuhaj-Varjú · 2013
Fun and GamesFun and Games (2nd 2008 Eindhoven, Netherlands) · 2008
Fun and GamesFun and Games (2nd 2008 Eindhoven, Netherlands) · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Quantum Turing machine A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple…
- Computation A computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computation are mathematical equation solving…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Church–Turing thesis In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers…
- Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
- Computability Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic…
- List of undecidable problems In computability theory, an undecidable problem is a decision problem for which an effective method (algorithm) to derive the correct answer does not exist…
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…