3 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Harry Altman
Define ∥n∥ to be the complexity of n, the smallest number of ones needed to write n using an arbitrary combination of addition and multiplication. John Selfridge showed tha…