Skip to search formSkip to main contentSkip to account menu

Specker sequence

Known as: Specker 
In computability theory, a Specker sequence is a computable, monotonically increasing, bounded sequence of rational numbers whose supremum is not a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Computability theoryComputable functionComputable numberComputation in the limit

Broader (1)

Computable analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Determining the e ff ects of Reproductive Performance on Bone Quality in Female House Mice
Much of calcium and phosphorus used to support skeletal ossification during prenatal and postnatal mammalian development are… 
2014
2014
RESEARCH ARTICLE Open Access Effect of Neurotransmitters on the Reproductive Biomarker and Ovarian Development in Giant Freshwater Prawn Macrobrachium rosenbergii (De Man, 1879)
In crustaceans, one of necessary things for embryonic and larval development is an extensive quantity of yolk accumulation within… 
2011
2011
Constructive reverse investigations into differential equations
We study Picard's Theorem and Peano's Theorem from a constructive reverse perspective. This means that we have to change our… 
2009
2009
Decidability and Specker sequences in intuitionistic mathematics
A bounded monotone sequence of reals without a limit is called a Specker sequence. In Russian constructive analysis, Church's… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)