Course-of-values recursion

#	Item
1	Recursive definitions are familiar in mathematics. For instance, the function f defined by f (0) = 1, f (1) = 1, f (x + 2) = f (x + 1) + f (x), gives the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, . . . . (The study of di Add to Reading List Source URL: www.ctan.org Language: English - Date: 2013-12-20 19:14:22 Theoretical computer science Functions and mappings Recursion Theory of computation Primitive recursive function Function Μ-recursive function Course-of-values recursion Computability theory Mathematics Mathematical logic
2	PDF Document Add to Reading List Source URL: ctan.org Language: English - Date: 2013-12-20 19:14:22 Theoretical computer science Functions and mappings Recursion Theory of computation Primitive recursive function Function Μ-recursive function Course-of-values recursion Computability theory Mathematics Mathematical logic