Tag: Ackermann Function
-
IT Nepal International Payment Gateway Survey
IT Nepal had carried a survey related to the International Payment Gateway in Nepal. IT Nepal is a mission to accelerate the information age of Nepal. It is a subset of Digital Nepal. It is supported by the first initiator of Digital Nepal. IT Nepal (as a group) is for helping each other, for assistance…
-
Ackermann Function
Ackermann Function is the simplest example of a well defined total function which is compatible but not primitive recursive. It grows faster than an exponential function. /* Ackermann Function */ #include<stdio.h> #include<stdlib.h> int count = 0, indent = 0; int ackermann(int x, int y) { count++; if(x<0 || y<0) return -1; if(x==0) return y+1; if(y==0)…