There Exists a Linear Problem with Infinite Combinatory Complexity

AbstractWe present a linear problem whose information complexity is finite but whose combinatory complexity is infinite. Thus, this linear problem has infinite complexity due to infinite combinatory complexity and not due to information complexity. This holds in a real number model in which we only allow arithmetic operations, comparisons of real numbers as well as precomputation of finitely many arbitrary elements. The result is not true if we can also evaluate logarithms, exponentials, and ceilings