Follow

Translate

Tuesday, March 15, 2016

What is Ackermann Function?



(a)  If m = 0 , then A(m, n) = n+1.

(b)  If m != 0 but n = 0, then A(m, n) = A(m-1, 1).

(c)  If m != 0 but n != 0, then A(m, n) = A(m-1, A(m, n-1)).

Obsrve that A(m, n) is explicitly only when m = 0. The base criteria are the pairs

            (0, 0),   (0, 1),  (0, 2),  (0. 3) ,................., (0, n), .........

The value of A(1, 3) is calculated in solved problem.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • Searching A LINK LIST LIST Is Sorted:   Algorithm:  SRCHSL(INFO, LINK, START, ITEM, LOC) LIST is a Sorted list in memory. This algorithm finds the location LOC of the node where ITEM first appears in LIST, or set… Read More
  • Queue What is Queue? Queue: A queue, also called a first-in first-out(FIFO) system, is a linear list in which deletions can take place only at one end of the list, the "front" of the list, and insertions can take place only at th… Read More
  • Data Structure Operations The following four operations play a major role in this text: 1.Traversing: Accessing each record exactly once so that certain items in the record may be processed. 2.Searching: Finding the location of the record with… Read More
  • Lesson One Data Stucture What is Data Structures? Data Structure: Data may be organized on many different ways; The logical or mathematical model of a particular organization of data is called a data structure. If You want to learn about the techn… Read More
  • Stack Lesson One What is mean Stack? Stack: A Stack, also called a last-in-first-out(LIFO) system, is a linear list in which insertions and deletions can take place only at one end, called the top If You want to learn about the technology,… Read More

0 comments:

Post a Comment