Revision as of 22:46, 30 April 2008 edit Mathemens (talk \| contribs) 28 edits ←Created page with 'A function <math>f \colon \mathbb{R} \to \mathbb{R}</math> is ''sequentially computable'' if, for every computable sequence <math>\{x_i\}_{i=1}^\inf...'		Revision as of 17:45, 12 April 2009 edit undo Jim.belk (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,907 edits Added context to first sentence Next edit →
Line 1: AIn [[mathematical logic]], specifically [[recursion theory\|computability theory]], a [[range\|function]] <math>f \colon \mathbb{R} \to \mathbb{R}</math> is ''sequentially computable'' if, for every [[computable sequence]] <math>\{x_i\}_{i=1}^\infty</math> of [[real number]]s, the [[sequence]] <math>\{f(x_i) \}_{i=1}^\infty</math> is also [[computable real number\|computable]]. A function <math>f \colon \mathbb{R} \to \mathbb{R}</math> is ''effectively uniformly continuous'' if there exists a [[primitive recursive function\|recursive function]] <math>d \colon \mathbb{N} \to \mathbb{N}</math> such that, if

Computable real function: Difference between revisions