Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Find these values of Ackermann’s function.

  1. A (1,0)
  2. B (0,1)
  3. C (1,1)
  4. D (2,2)

Short Answer

Expert verified
  1. The value of A (1,0) is 2.
  2. The value of B (0,1) is 2.
  3. The value of C (1,1) is 3.
  4. The value of D (2,2) is 7.

Step by step solution

01

Step 1:Introduction

The Ackermann function is defined as the simplest example of a well-defined total function that is computable but not primitive recursive.

02

(a) Find  

There are several different variants of this function. All are calledAckermann’s functions and have similar properties even though their values do not always agree. One common version, the two-argument Ackermann-Peter function, is defined as follows

For nonnegative integers m and n :

A(m,n)=n+1    ifm=0A(m1,1)    ifm>0andn=0A(m1,A(m,n1))    ifm>0andn>0

Its value grows rapidly, even for small inputs.

A (1,0) = A (1 - 1,1)

= A (0,1)

By the above definition of Ackermann’s function,

This implies;

A (0,1) = 1+1

= 2

Hence, the value is 2.

03

:( b) Find  

There are several different variants of this function. All are calledAckermann’s functions and have similar properties even though their values do not always agree. One common version, the two-argument Ackermann-Peter function, is defined as follows

For nonnegative integers and :

A(m,n)=n+1    ifm=0A(m1,1)    ifm>0andn=0A(m1,A(m,n1))    ifm>0andn>0

Its value grows rapidly, even for small inputs.

A (0,1) = A (1- , 1,1)

By the above definition of Ackermann’s function,

This implies;

A (0,1) = 1+1

= 2

Hence, the value is 2.

04

(c) Find  

There are several different variants of this function. All are calledAckermann’s functions and have similar properties even though their values do not always agree. One common version, the two-argument Ackermann-Peter function, is defined as follows

For nonnegative integers m and n:

A(m,n)=n+1    ifm=0A(m1,1)    ifm>0andn=0A(m1,A(m,n1))    ifm>0andn>0

Its value grows rapidly, even for small inputs.

A (0,1) = A (0,A(1,0))

= A (0,2)

= 3

Hence, the value is 3.

05

(d) Find  A (2,2)

There are several different variants of this function. All are calledAckermann’s functions and have similar properties even though their values do not always agree.

One common version, the two-argument Ackermann-Peter function, is defined as follows

For nonnegative integers m and n:

A(m,n)=n+1    ifm=0A(m1,1)    ifm>0andn=0A(m1,A(m,n1))    ifm>0andn>0

Its value grows rapidly, even for small inputs.

By the above definition of Ackermann’s function,

A(2,2)=A(1,A(2,1))=A(1,A(1,A(2,0)))=A(1,A(1,A(1,1)))=A(1,A(1,3))

Now,

A(1,3)=A(1,3)=A(0,A(1,))=A(0,A(0,A(1,1)))=A(0,A(0,3))A(1,3)=A(0,(3+1))=A(0,4)=4+1=5

Now we have,

A(1,n)=n+2A(1,5)=5+2=7

Hence, the value is 7.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free