Live briefing
Everything about Super-recursive algorithm
Generalization of ordinary algorithms that compute more than Turing machines
In computability theory, super-recursive algorithms are posited as a generalization of hypercomputation: hypothetical algorithms that are more powerful, that is, compute more than Turing machines. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Super-recursive algorithmA 5-minute orientation
- Skim a recent paper: Optimal Recursive Terminal Sliding-Mode Control Using Super-Twisting Algorithm for Improving High Efficiency and Reliability of Pump SystemsInfluential work since 2022
- Pick up a classic book: Super-Recursive AlgorithmsThe most-reprinted book on the subject
- Read the landmark paper: Recursive Deep Prior Video: A super resolution algorithm for time-lapse microscopy of organ-on-chip experimentsCited 41 times
- Go sideways: Church–Turing thesisA closely related topic
- Go sideways: HypercomputationA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Recursive Deep Prior Video: A super resolution algorithm for time-lapse microscopy of organ-on-chip experiments
A novel image super-resolution algorithm based on multi-scale dense recursive fusion network
A Multi-Scale Recursive Attention Feature Fusion Network for Image Super-Resolution Reconstruction Algorithm
Recursive super-resolution algorithm for low-elevation target angle tracking in multipath
Super-recursive algorithms
Image super-resolution reconstruction algorithm based on multi-scale recursive attention and feature fusion
Noise-robust boundary recursive algorithm for super-resolution reconstruction of staring focal plane array micro-scanning imaging
🆕 Influential since 2022
đź“š Books worth reading
Super-Recursive AlgorithmsMark Burgin · 2010
Super-Recursive Algorithms (Monographs in Computer Science)Mark Burgin · 2004
Super-Recursive Algorithms (Monographs in Computer Science)Mark Burgin · 2006
Java concepts for interview · 2025
Mathematical Statistics Theory and ApplicationsYu. A. Prokhorov, V. V. Sazonov · 2020
Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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…
- Hypercomputation Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For…
- Computable function Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes…
- History of the Church–Turing thesis The history of the Church–Turing thesis ("thesis") involves the history of the development of the study of the nature of functions whose values are effectively…
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…
- Theory of computation In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation…
- Algorithm characterizations Algorithm characterizations are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers are…
- List of computability and complexity topics This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with…