A measure of intelligence of an approximation of a real number in a given model

arXiv1703.01345MaRDI QIDQ6283873

Author name not available (Why is that?)

Publication date: 1 March 2017

Abstract: In this paper, we present a way to measure the intelligence (or the interest) of an approximation of a given real number in a given model of approximation. Basing on the idea of the complexity of a number, defined as the number of its digits, we introduce a function noted $mu$ (called a measure of intelligence) associating to any approximation $mathbfapp$ of a given real number in a given model a positive number $mu(mathbfapp)$, which characterises the intelligence of that approximation. Precisely, the approximation $mathbfapp$ is intelligent if and only if $mu(mathbfapp)geq1$. We illustrate our theory by several numerical examples and also by applying it to the rational model. In such case, we show that it is coherent with the classical rational diophantine approximation. We end the paper by proposing an open problem which asks if any real number can be intelligently approximated in a given model for which it is a limit point.

Mathematics Subject Classification ID

No records found.

This page was built for publication: A measure of intelligence of an approximation of a real number in a given model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283873)