# Integer Complexity: Experimental and Analytical Results II

@inproceedings{Cernenoks2014IntegerCE,
title={Integer Complexity: Experimental and Analytical Results II},
author={Juris Cernenoks and Janis Iraids and Martins Opmanis and Rihards Opmanis and Karlis Podnieks},
booktitle={Workshop on Descriptional Complexity of Formal Systems},
year={2014}
}
• Published in
Workshop on Descriptional…
1 September 2014
• Mathematics
We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\| n \right\|_{\log}$ is defined as $\left\| n \right\|/{\log_3 n}$. The values of $\left\| n \right\|_{\log}$ are located in the segment $[3, 4.755]$, but almost nothing is known with certainty about the structure of this "spectrum" (are the values dense…
10 Citations
An algorithm for computing K(n) is described, and it is shown that the set of stable numbers is a computable set, and the defect of a number is defined by $\delta(n):=\|n\|-3\log_3 n$, building on the methods presented in .
• Computer Science
• 2014
Three algorithms to compute the complexity of all natural numbers, each superior to the one in , are presented and it is shown that they run in time $O(N^\alpha)$ and space $N\log\log N)$.
Markov chain methods are used to analyze a large class of algorithms, including one found by David Bevan that improves the upper bound to f(n) \leq 3.52 \log_{3}{n} on a set of logarithmic density one.
• Mathematics, Computer Science
Integers
• 2019
A method is discussed that provides a strong uniform bound on the number of summands that must be calculated for almost all $n$ and potential improvements to this algorithm are discussed.
The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In
We discuss the optimal presentations of mathematical objects under well defined symbol libraries. We shall examine what light our chosen symbol libraries and syntax shed upon the objects they
This study aims to reveal and emphasize the role of mathematics in formulating the conceptual and measurement stages of complexity, chaos, and randomness in natural dynamical systems.
This paper provides the first non-trivial upper bound for all n, where for all $n>1$ the authors have $||n|| \leq A \log n$ where $A = \frac{41}{\log 55296}$.
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 that \$\|n\| \ge