# Sloane's Gap. Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS ?

@article{Gauvrit2011SloanesGD, title={Sloane's Gap. Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS ?}, author={Nicolas Gauvrit and J. P. Delahaye and Hector Zenil}, journal={Journal of humanistic mathematics}, year={2011}, volume={3}, pages={3-19} }

The Online Encyclopedia of Integer Sequences (OEIS) is a catalog of integer sequences. We are particularly interested in the number of occurrences of N(n) of an integer n in the database. This number N(n) marks the importance of n and it varies noticeably from one number to another, and from one number to the next in a series. \Importance" can be mathematically objective (2 10 is an example of an \important" number in this sense) or as the result of a shared mathematical culture (10 9 is more…

## 3 Citations

Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity

- Computer ScienceArXiv
- 2021

It is investigated if a more expressive higher-level programming language can be more efficient at generating approximations to algorithmic complexity of recursive functions, often of mathematical interest.

Une approche expérimentale à la théorie algorithmique de la complexité

- Computer Science, Philosophy
- 2011

Une methode "naturelle" is proposed qui permet d'envisager une definition plus stable de la complexite de Kolmogorov-Chaitin K(s) via the mesure de probabilite algorithmique m(s).

## References

SHOWING 1-10 OF 13 REFERENCES

The On-Line Encyclopedia of Integer Sequences

- Computer ScienceElectron. J. Comb.
- 1994

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.

On the Kolmogorov-Chaitin Complexity for short sequences

- Computer ScienceArXiv
- 2007

An empirical approach is suggested to overcome the difficulty and obtain a stable definition of the Kolmogorov-Chaitin complexity for short sequences and a correlation in terms of distribution frequencies was found across the output of two models of abstract machines, namely unidimensional cellular automata and deterministic Turing machine.

The encyclopedia of integer sequences

- Computer Science
- 1995

This book presents methods for Computer Investigation of Sequences, a method for hand analysis of sequences, and some of the methods used in this work, as well as suggestions for further study.

An Introduction to Kolmogorov Complexity and Its Applications

- Computer ScienceTexts and Monographs in Computer Science
- 1993

The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.

A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms

- Computer ScienceAnnals of the History of Computing
- 1984

This paper is a personal account of some events, ideas, and academic controversies that surrounded the discovery and investigation of non-deterministic polynomial (NP)-complete problems independently by S. Cook and R. Karp in the United States and L. Levin in the Soviet Union.

Algorithmic information theory

- Computer ScienceCambridge tracts in theoretical computer science
- 1987