Donald G. Palmer

CNRS-Pr4: Partial Operational Completeness of a Positional Number System for Complex Numbers

We study operational completeness of the canonical number system (CNS) for the base z0 =−2 + i in Z[i], extended to a positional system for the complex numbers, together with a differential extension. The system comprises: Layer 1 (CNRS-A), the CNS itself with digit alphabet {0,1...

CNRS-Pr2: Complex Numbers as Single Values: A Three-Layer Architecture for the Complex Numeric Representational System

We present a three-layer architecture for Problem 2 of the Complex Numeric Representational System (CNRS) programme: the construction of a positional numeral system in which a single sequence of real integer digits encodes a single complex number, with no ordered-pair structure,...

CNRS-Pr2(1-3): A Single-Value Complex Numeral System via Canonical Number Systems and the Riemann Surface of the Logarithm

We construct a positional numeral system in which a single sequence of real integer digits encodes a single complex number — with no ordered-pair structure and no separator symbol between real and imaginary parts — and on which the logarithm and exponentiation are single-valued....

CNRS-Pr3-1: Arithmetic Closure for the Complex Numeric Representational System: Working Paper — Problem 3 of the CNRS Programme

Problem 3 of the Complex Numeric Representational System (CNRS) programme asks whether addition and multiplication of CNRS digit strings — that is, digit strings in base−2 + i with digit alphabet {0, 1, 2, 3, 4}— are computable by finite automata. This is the difference between h...