Counting Algorithms in Python

A counting algorithm is realized by a function “succ” that applies to a numeral and provides the numeral of the following number. If we apply succ to an initial element, denoted by [], we get the numeral of number one, then applying again “succ” to it we get the numeral of two, and so on. Therefore, 1000 applications of “succ” to the last obtained numeral will provide the numerals of the first 1000 numbers. The nature of counting algorithms and their differences will be considered, which enlighten many important aspects of numbers, usually given for granted.