(...) (From (URL) searching for "The Ackermann Function") The url to a description of Ackermann's function: (URL) excerpt from that page: Ackermann's function, while Turing computable, grows faster than any primitive recursive function. This means (...) (25 years ago, 13-May-99, to lugnet.robotics)
|
