The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Basics of recursive functions
Replies: 3   Last Post: Aug 26, 2012 1:49 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 1,923
Registered: 1/29/05
Re: Basics of recursive functions
Posted: Aug 26, 2012 1:49 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Am Samstag, 25. August 2012 20:56:31 UTC+2 schrieb (unbekannt):
> In order to try and understand the Godel incompleteness proofs, I am trying to fill in the following gap in my understanding.
> Let f be a function: N ^ k -> N where N denotes the natural numbers and ^ k means to take the n-fold Cartesian product.
> Suppose f(0, x_1,...,x_k-1) is a recursive function from N ^ k-1 to N.
> Suppose also that for x_1 > 0, f(x_1, ..., x_k) can be defined in terms of recursive functions and in terms of f(x_1 - 1, ..., x_k).

To avoid ambiguity (such as accidentally allwoing to chose a different recursive function for each value of x_1), I'd prefer for the second condition:

There is a recursive function g: N^(k+1) -> N such that
f(x_1+1, x_2, ..., x_k) = g(x_1, ..., x_k, f(x_1, ..., x_k))
holds for all (x_1, .., x_k) in N^k

> Why is f recursive?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.