Difference between revisions of "Recursive predicate"
From Encyclopedia of Mathematics
(Importing text file) |
Ulf Rehmann (talk | contribs) m (tex encoded by computer) |
||
| Line 1: | Line 1: | ||
| − | A | + | <!-- |
| + | r0803001.png | ||
| + | $#A+1 = 3 n = 0 | ||
| + | $#C+1 = 3 : ~/encyclopedia/old_files/data/R080/R.0800300 Recursive predicate | ||
| + | Automatically converted into TeX, above some diagnostics. | ||
| + | Please remove this comment and the {{TEX|auto}} line below, | ||
| + | if TeX found to be correct. | ||
| + | --> | ||
| − | + | {{TEX|auto}} | |
| + | {{TEX|done}} | ||
| + | |||
| + | A [[Predicate|predicate]] $ P( x _ {1} \dots x _ {n} ) $ | ||
| + | defined on the natural numbers, such that the function $ f $ | ||
| + | defined on the natural numbers by the condition | ||
| + | |||
| + | $$ | ||
| + | f( x _ {1} \dots x _ {n} ) = \left \{ | ||
is a [[Recursive function|recursive function]]. | is a [[Recursive function|recursive function]]. | ||
Revision as of 08:10, 6 June 2020
A predicate $ P( x _ {1} \dots x _ {n} ) $
defined on the natural numbers, such that the function $ f $
defined on the natural numbers by the condition
$$ f( x _ {1} \dots x _ {n} ) = \left \{
is a recursive function.
How to Cite This Entry:
Recursive predicate. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Recursive_predicate&oldid=13803
Recursive predicate. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Recursive_predicate&oldid=13803
This article was adapted from an original article by V.E. Plisko (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article