Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Specker_sequence> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Specker_sequence abstract "In computability theory, a Specker sequence is a computable, monotonically increasing, bounded sequence of rational numbers whose supremum is not a computable real number. The first example of such a sequence was constructed by Ernst Specker in 1949. The existence of Specker sequences has consequences for computable analysis. The fact that such sequences exist means that the collection of all computable real numbers does not satisfy the least upper bound principle of real analysis, even when considering only computable sequences. A common way to resolve this difficulty is to consider only sequences that are accompanied by a modulus of convergence; no Specker sequence has a computable modulus of convergence. The least upper bound principle has also been analyzed in the program of reverse mathematics, where the exact strength of this principle has been determined. In the terminology of that program, the least upper bound principle is equivalent to ACA0 over RCA0.".
- Specker_sequence thumbnail SuiteSpecker.svg?width=300.
- Specker_sequence wikiPageID "21535918".
- Specker_sequence wikiPageLength "4592".
- Specker_sequence wikiPageOutDegree "14".
- Specker_sequence wikiPageRevisionID "646881932".
- Specker_sequence wikiPageWikiLink Category:Computable_analysis.
- Specker_sequence wikiPageWikiLink Computability_theory.
- Specker_sequence wikiPageWikiLink Computable_analysis.
- Specker_sequence wikiPageWikiLink Computable_function.
- Specker_sequence wikiPageWikiLink Computable_number.
- Specker_sequence wikiPageWikiLink Computation_in_the_limit.
- Specker_sequence wikiPageWikiLink Ernst_Specker.
- Specker_sequence wikiPageWikiLink Infimum_and_supremum.
- Specker_sequence wikiPageWikiLink Least-upper-bound_property.
- Specker_sequence wikiPageWikiLink Modulus_of_convergence.
- Specker_sequence wikiPageWikiLink Recursive_set.
- Specker_sequence wikiPageWikiLink Recursively_enumerable_set.
- Specker_sequence wikiPageWikiLink Reverse_mathematics.
- Specker_sequence wikiPageWikiLink File:SuiteSpecker.svg.
- Specker_sequence wikiPageWikiLinkText "Specker sequence".
- Specker_sequence wikiPageUsesTemplate Template:Doi.
- Specker_sequence wikiPageUsesTemplate Template:No_footnotes.
- Specker_sequence subject Category:Computable_analysis.
- Specker_sequence comment "In computability theory, a Specker sequence is a computable, monotonically increasing, bounded sequence of rational numbers whose supremum is not a computable real number. The first example of such a sequence was constructed by Ernst Specker in 1949. The existence of Specker sequences has consequences for computable analysis.".
- Specker_sequence label "Specker sequence".
- Specker_sequence sameAs Q2308311.
- Specker_sequence sameAs Specker-Folge.
- Specker_sequence sameAs Suite_de_Specker.
- Specker_sequence sameAs m.05h2rd6.
- Specker_sequence sameAs Q2308311.
- Specker_sequence wasDerivedFrom Specker_sequence?oldid=646881932.
- Specker_sequence depiction SuiteSpecker.svg.
- Specker_sequence isPrimaryTopicOf Specker_sequence.