Abstrakt
We analyze the time complexity of exact real arithmetical algorithms in Mobius number systems. Using the methods of Ergodic theory, we associate to any Mobius number system its transaction quotient and show that the norm of the state matrix is linear in the number of transactions.
We show that our Bimodular number system computes some arithmetical operations faster than any standard positional system.