3 citations · 7 across the 5 of their papers we have counts for
7 papers · 1 filter
Integer complexity: Stability and self-similarity
Harry Altman, Juan Arias de Reyna
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. The set of…
Integer complexity: The integer defect
Harry Altman
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. John Selfridge showed tha…
Integer complexity: algorithms and computational results
Harry Altman
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. Define to be stable i…
Integer Complexity: Representing Numbers of Bounded Defect
Harry Altman
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. John Selfridge showed tha…
Internal Structure of Addition Chains: Well-Ordering
Harry Altman
An addition chain for is defined to be a sequence such that , , and, for any , there exist such that $a_k = a_i…
Integer Complexity and Well-Ordering
Harry Altman
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. John Selfridge showed tha…
Numbers with Integer Complexity Close to the Lower Bound
Harry Altman, Joshua Zelinsky
Define to be the complexity of , the smallest number of 1's needed to write using an arbitrary combination of addition and multiplication. John Selfridge showed that $…