Live briefing
Everything about Computable function
Mathematical function that can be computed by a program
Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes the value of the function for every value of its argument. Because of the lack of a precise definition of the concept of algorithm, every formal definition of computability must refer to a specific model of computation. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Computable functionA 5-minute orientation
- Pick up a classic book: Precalculus With LimitsThe most-reprinted book on the subject
- Read the landmark paper: Computable functionalsCited 171 times
- Go sideways: Computability theoryA closely related topic
- Go sideways: Computably enumerable setA closely related topic
đź“– Definitions
Noun A mathematical function that can be computed using an abstract computation machine such as Turing machine.
🏆 Landmark papers (most cited)
Computable functionals
Finding Global Minima with a Computable Filled Function
When Is a Function Securely Computable?
Computable translucency as a function of thickness in a multi-layered zirconia
A friendly computable characteristic function
On the Definition of Computable Function of a Real Variable
A Banach–Mazur computable but not Markov computable function on the computable real numbers
A computable filled function used for global minimization
đź“š Books worth reading
Precalculus With LimitsRon Larson · 1993
Computability and logicGeorge Boolos, Richard C. Jeffrey · 1974
Complex variables and applicationsJames Ward Brown, Ruel Vance Churchill · 1995
Computability & unsolvabilityDavis, Martin · 1958
Purely functional data structuresChris Okasaki · 1998- 📕Programming in HaskellGraham Hutton · 2006
Theory of recursive functions and effective computabilityHartley Rogers · 1957
Clojure programmingChas Emerick · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…
- Computably enumerable set In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable…
- General recursive function In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from…
- Kleene's recursion theorem In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions…
- 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…
- Alpha recursion theory In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals α. An admissible set is closed under…
- Primitive recursive function In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all…
- 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…