This HTML5 document contains 33 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n9	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Computation_in_the_limit

rdf:type

dbo:Stream

rdfs:label

Computation in the limit

rdfs:comment

In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in the limit, limit recursive and recursively approximable are also used. One can think of limit computable functions as those admitting an eventually correct computable guessing procedure at their true value. A set is limit computable just when its characteristic function is limit computable. If the sequence is uniformly computable relative to D, then the function is limit computable in D.

owl:sameAs

freebase:m.08qhss

dct:subject

dbc:Computability_theory dbc:Theory_of_computation

gold:hypernym

dbr:Limit

prov:wasDerivedFrom

n9:Computation_in_the_limit?oldid=1022779492&ns=0

dbo:wikiPageID

3086963

dbo:wikiPageLength

6051

dbo:wikiPageRevisionID

1022779492

dbo:wikiPageWikiLink

dbr:Modulus_of_convergence dbr:Halting_problem dbr:Computability dbr:Partial_function dbr:Post's_theorem dbr:Computability_theory dbr:Natural_number dbr:Real_number dbr:Computable_function dbc:Computability_theory dbr:Turing_jump dbr:Specker_sequence dbc:Theory_of_computation dbr:Computable_number dbr:Rational_number dbr:Computable_set dbr:Indicator_function dbr:Turing_reduction dbr:Chaitin's_constant dbr:List_of_first-order_theories

dbo:abstract

In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in the limit, limit recursive and recursively approximable are also used. One can think of limit computable functions as those admitting an eventually correct computable guessing procedure at their true value. A set is limit computable just when its characteristic function is limit computable. If the sequence is uniformly computable relative to D, then the function is limit computable in D.

foaf:isPrimaryTopicOf

n9:Computation_in_the_limit