Recent benchmarks of large language models have mainly focused on general mathematics problems and the currently infeasible objective of automated theorem proving. In this project, we focus on a more ...

Algorithmic randomness and computability theory inhabit a crossroads between mathematics and computer science, providing a rigorous framework for understanding randomness in infinite sequences and ...

Algorithmic information theory provides a rigorous framework for quantifying the inherent complexity of data, most notably through the concept of Kolmogorov complexity. This theoretical underpinning ...

The ANTS meetings, held biannually since 1994, are the premier international forum for the presentation of new research in computational number theory and its applications. They are devoted to ...

ABSTRACT: Over millennia, people have considered prime numbers as unpredictable and hard to list. This study confirms that all positive integers without factors of 2, 3, 5 and 7 can be regarded as the ...

This is a graduate-level course on Algorithmic Game Theory and Mechanism Design. We will cover some of the theoretical foundations of game theory and mechanism design, and cover a number of the most ...

This repository contains a solver for a graph-colouring game designed by Erdös which is created for the article "On edge-colouring-games by Erdös, and Bensail and Mc Inerney". The latest version of ...