Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Course-of-values_recursion> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Course-of-values_recursion abstract "In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n+1) is computed from the sequence . The fact that such definitions can be converted into definitions using a simpler form of recursion is often used to prove that functions defined by course-of-values recursion are primitive recursive.This article uses the convention that the natural numbers are the set {1,2,3,4,...}.".
- Course-of-values_recursion wikiPageID "3989260".
- Course-of-values_recursion wikiPageRevisionID "533176028".
- Course-of-values_recursion hasPhotoCollection Course-of-values_recursion.
- Course-of-values_recursion subject Category:Computability_theory.
- Course-of-values_recursion subject Category:Recursion.
- Course-of-values_recursion comment "In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n+1) is computed from the sequence .".
- Course-of-values_recursion label "Course-of-values recursion".
- Course-of-values_recursion sameAs m.0bb9c7.
- Course-of-values_recursion sameAs Q5178160.
- Course-of-values_recursion sameAs Q5178160.
- Course-of-values_recursion wasDerivedFrom Course-of-values_recursion?oldid=533176028.
- Course-of-values_recursion isPrimaryTopicOf Course-of-values_recursion.