Primitive Recursive Proof in Davis, Sigal & Weyuker Textbook

  • Thread starter gnome
  • Start date
  • Tags
    Primitive
In summary, the Davis, Sigal & Weyuker textbook "Computability, Complexity and Languages" presents a proof for the function f(x) = x + y using the functions u, s, and g, which are all primitive recursive. They also mention that their definition of recursion involves two forms, and their proof must follow the same format as their definition. They clarify that this is the standard definition of primitive recursion and that all proofs involving recursion must follow this format.
  • #1
gnome
1,041
1
In the Davis, Sigal & Weyuker textbook "Computability, Complexity and Languages" their proof that [itex]f(x) = x + y[/itex] goes like this:
[tex]\begin{equation*}\begin{split}f(x,0) &= u_1^1(x)\\f(x,y+1) &= g(y,f(x,y),x)\end{split}\end{equation*}[/tex]
where [itex] g(x_1,x_2,x_3) = s(u_2^3(x_1,x_2,x_3))[/itex].

And (I'm paraphrasing now in the interest of brevity) these functions u, s and g are all primitive recursive so therefore f is too.

I'm wondering, would it be equally valid (and simpler) to say
[tex]\begin{equation*}\begin{split}f(x,0) &= u_1^1(x)\\f(x,y+1) &= s(f(x,y))\end{split}\end{equation*}[/tex]
followed by the same explanation?

Apparently, the reason for the form of their proof is that they defined recursion to be one of these two "things":
Either:
[tex]\begin{equation*}\begin{split}h(0) &= k\\h(t+1) &= g(t,h(t))\end{split}\end{equation*}[/tex]
or:
[tex]\begin{equation*}\begin{split}h(x_1,...,x_n,0) &= f(x_1,...,x_n),\\h(x_1,...,x_n,t+1) &= g(t,h(x_1,...,x_n,t),x_1,...,x_n)\end{split}\end{equation*}[/tex]
and they had to put their proof into the same form as their definition of recursion.

So I guess my question boils down to, is that just their definition of recursion, or is it everybody's?

i.e. does every proof involving recursion have to be in exactly that format?
 
Physics news on Phys.org
  • #2
That is the standard definition of primitive recursion.

Both of the examples are primitive recursive. The foot note on page 40 indicates that they will agree to call "primitive recursion", "recursion" simply as a convenience, until later.
 
  • #3


The proof presented in the Davis, Sigal & Weyuker textbook is a valid proof using the primitive recursive definition of recursion. The authors have chosen to present the proof in this specific format because it aligns with their definition of recursion. However, it is not necessary for every proof involving recursion to be in this exact format. There are other equivalent ways to define recursion, and as long as the proof follows the principles of recursion and is logically sound, it can be presented in a different format.

In fact, the alternative proof you have proposed is also a valid proof using the primitive recursive definition of recursion. It is simpler and more concise, but it still follows the same principles and logic as the original proof.

In conclusion, the specific format used in the Davis, Sigal & Weyuker textbook is their chosen definition of recursion, but it is not the only way to define recursion or present a proof involving recursion. As long as the proof follows the principles of recursion, it can be presented in different formats.
 

FAQ: Primitive Recursive Proof in Davis, Sigal & Weyuker Textbook

What is the concept of primitive recursive proof?

The concept of primitive recursive proof is a method used in mathematical logic to demonstrate that a function is computable. It involves breaking down a function into simpler primitive recursive functions and proving that these simpler functions can be combined to compute the original function. This proof method is used to show that a function can be computed by a computer program.

What are the key components of a primitive recursive proof?

The key components of a primitive recursive proof include defining the primitive recursive functions, using recursive definitions to break down a function into simpler components, and using primitive recursive equations to combine these components and prove the computability of the original function. The proof also involves using mathematical induction to show that the function holds for all possible inputs.

How is primitive recursive proof used in the Davis, Sigal & Weyuker textbook?

The Davis, Sigal & Weyuker textbook uses primitive recursive proof as a foundational concept in the study of computability and complexity. It introduces the concept in the context of recursive functions and then uses it to prove the computability of various functions in later chapters. It also discusses the limitations of primitive recursive functions and introduces more powerful proof methods, such as the use of Turing machines.

What are the limitations of primitive recursive proof?

One limitation of primitive recursive proof is that it can only be used to prove the computability of functions that can be broken down into simpler primitive recursive functions. This means that some functions, such as the Ackermann function, cannot be proven to be computable using this method. Additionally, primitive recursive proof does not allow for the use of iteration or unbounded minimization, which are necessary for proving the computability of more complex functions.

How does primitive recursive proof relate to other proof methods in mathematical logic?

Primitive recursive proof is one of several methods used in mathematical logic to prove the computability of functions. It is closely related to primitive recursive functions and is often used in conjunction with other proof methods, such as recursive definitions and mathematical induction. Other proof methods, such as the use of Turing machines, are more powerful and can be used to prove the computability of functions that cannot be proven using primitive recursive proof alone.

Similar threads

Replies
1
Views
2K
Replies
6
Views
2K
Replies
1
Views
1K
Replies
5
Views
3K
Replies
12
Views
3K
Back
Top