
Recent Posts
Recent Comments
Archives
Categories
Meta
Tag Archives: Ackermann’s Function
RepliCount Programmed in Scheme
This post describes the implementation of the HyperOpreation Function, aka Ackermann’s Function, which I call RepliCount, in the Scheme Programming Language. RepliCount is a recursive function that performs arithmetic operations on natural numbers by reducing the operation by stages to … Continue reading
Posted in STEM
Tagged Ackermann's Function, addition, exponentiation, hyperoperation, math, multiplication, Peano, recursion, successor function, tetration
Leave a comment
RepliCount Function Example: 2^3
In a previous post I discussed the HyperOperation function H(m,n,k) which is a Recursive Functions reducing arithmetic operations on natural numbers to Peano Successor. Here I give an example of a complete computation, evaluating 2^3. Operator Notation: ^ k=3 Exponentiation … Continue reading
Posted in STEM
Tagged Ackermann's Function, addition, exponentiation, multiplication, Peano Arithmetic, recursion
Leave a comment
RepliCount: A Recursive Function for Natural Number Arithmetic
ABSTRACT: We demonstrate a single recursive function, a variation of Ackermann’s Function, that represents the operations of natural number arithmetic–addition, multiplication, power, and even higherorder operations such as “tower”–in terms of only the elementary concepts of the Peano Postulates, including … Continue reading
Posted in STEM
Tagged Ackermann's Function, addition, exponentiation, hyperoperation, hyperoperations, math, multiplication, Peano, power, recursion, successor function, tetration
Leave a comment