Computable function

Known as: Total recursive function, Noncomputable function, Incomputable function 
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion… (More)
Wikipedia

Related topics

Related topics

50 relations
AI-completeArithmetical setBrouwer–Heyting–Kolmogorov interpretationBusy beaver
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Computable Functions in ASP: Theory and Implementation
Disjunctive Logic Programming (DLP) under the answer set semantics, often referred to as Answer Set Programming (ASP), is a… (More)
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Agency Costs , Net Worth , and Business Fluctuations : A Computable General Equilibrium Analysis
This paper develops a computable general equilibrium model in which endogenous agency costs can potentially alter business-cycle… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Computable Analysis
It's not surprisingly when entering this site to get the book. One of the popular books now is the computable analysis. You may… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
An Efficiently Computable Metric for Comparing Polygonal Shapes
Model-based recognition is concerned with comparing a shape A, which is stored as a model for some particular object, with a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Pseudo-random Generation from one-way functions (Extended Abstracts)
We show that the existence of one-way functions is necessary and sufficient for the existence of pseudo-random generators in the… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Relational Queries Computable in Polynomial Time
We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Computable Queries for Relational Data Bases
The concept of “reasonable” queries on relational data bases is investigated. We provide an abstract characterization of the… (More)
Is this relevant?
Highly Cited
1963
Highly Cited
1963
Computability of Recursive Functions
As a result of the work of Turing, Post, Kleene and Church [1, 2, 3, 9, 10, l l 12, 17, 18] it is now widely accepted ~ that the… (More)
  • figure 1
Is this relevant?
Highly Cited
1937
Highly Cited
1937
On computable numbers, with an application to the Entscheidungsproblem
The "computable" numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?