Tag Archives: Peano

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 , , , , , , , , , | 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 higher-order operations such as “tower”–in terms of only the elementary concepts of the Peano Postulates, including … Continue reading
Posted in STEM | Tagged , , , , , , , , , , , | Leave a comment