English
Related papers

Related papers: The Busy Beaver Competition: a historical survey

200 papers

This work provides the first inductive definition of useful CBV evaluation. For that, we first restrict the substitution operation in the Value Substitution Calculus to be linear, yielding the LCBV strategy. We then further restrict…

Logic in Computer Science · Computer Science 2025-02-13 Pablo Barenbaum , Delia Kesner , Mariana Milicich

The Bayes factor, the data-based updating factor from prior to posterior odds, is a principled measure of relative evidence for two competing hypotheses. It is naturally suited to sequential data analysis in settings such as clinical trials…

Methodology · Statistics 2026-01-07 Samuel Pawel , Leonhard Held

We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a…

Logic · Mathematics 2016-05-12 Vasco Brattka , Guido Gherardi , Rupert Hölzl

Real-life agents seldom have unlimited reasoning power. In this paper, we propose and study a new formal notion of computationally bounded strategic ability in multi-agent systems. The notion characterizes the ability of a set of agents to…

Multiagent Systems · Computer Science 2023-10-27 Catalin Dima , Wojciech Jamroga

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently…

Machine Learning · Computer Science 2016-04-25 Daniel Filan , Marcus Hutter , Jan Leike

The Turaev-Viro invariants are a powerful family of topological invariants for distinguishing between different 3-manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. The…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Clément Maria , Jonathan Spreer

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

Computational Complexity · Computer Science 2024-06-04 Riccardo Gozzi , Olivier Bournez

Academic challenges comprise effective means for (i) advancing the state of the art, (ii) putting in the spotlight of a scientific community specific topics and problems, as well as (iii) closing the gap for under represented communities in…

Machine Learning · Computer Science 2023-12-04 Hugo Jair Escalante , Aleksandra Kruchinina

In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability $p \in (0, 1/2)$. In this paper, we obtain tight bounds on the noisy query complexity of several…

Data Structures and Algorithms · Computer Science 2025-02-17 Yuzhou Gu , Xin Li , Yinzhan Xu

The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…

Logic in Computer Science · Computer Science 2021-01-05 Pieter Collins

We consider a multi-organizational system in which each organization contributes processors to the global pool but also jobs to be processed on the common resources. The fairness of the scheduling algorithm is essential for the stability…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-04-23 Piotr Skowron , Krzysztof Rzadca

We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…

Logic · Mathematics 2023-06-22 Nathanael L. Ackerman , Cameron E. Freer , Robert S. Lubarsky

In many practical applications of learning algorithms, unlabeled data is cheap and abundant whereas labeled data is expensive. Active learning algorithms developed to achieve better performance with lower cost. Usually Representativeness…

Machine Learning · Computer Science 2016-08-26 Hossein Ghafarian , Hadi Sadoghi Yazdi

In 1961 Herbert Simon and Albert Ando published the theory behind the long-term behavior of a dynamical system that can be described by a nearly uncoupled matrix. Over the past fifty years this theory has been used in a variety of contexts,…

Numerical Analysis · Mathematics 2012-04-26 Carl D. Meyer , Charles D. Wessell

The dynamic optimality conjecture, postulating the existence of an $O(1)$-competitive online algorithm for binary search trees (BSTs), is among the most fundamental open problems in dynamic data structures. Despite extensive work and some…

Data Structures and Algorithms · Computer Science 2019-12-24 Parinya Chalermsook , Julia Chuzhoy , Thatchaphol Saranurak

In machine learning it is common to interpret each data point as a vector in Euclidean space. However the data may actually be functional i.e.\ each data point is a function of some variable such as time and the function is discretely…

Computer Vision and Pattern Recognition · Computer Science 2017-04-14 Stephen Tierney , Junbin Gao , Yi Guo , Zheng Zhang

Modeling each hit as a multivariate event in racket sports and conducting sequential analysis aids in assessing player/team performance and identifying successful tactics for coaches and analysts. However, the complex correlations among…

Databases · Computer Science 2023-07-27 Jiang Wu , Dongyu Liu , Ziyang Guo , Yingcai Wu

Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an integer-valued vector $b$ of dimension $\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously…

Combinatorics · Mathematics 2018-11-29 Robert Hancock

We describe a contest in variable selection which was part of a statistics course for graduate students. In particular, the possibility to create a contest themselves offered an additional challenge for more advanced students. Since working…

Other Statistics · Statistics 2018-09-13 Sam Doerken , Martin Schumacher , Franz Baumdicker

Bipartite graphs characterize relationships between two different sets of entities, like actor-movie, user-item, and author-paper. The butterfly, a 4-vertices 4-edges (2,2)-biclique, is the simplest cohesive motif in a bipartite graph and…

Data Structures and Algorithms · Computer Science 2026-04-21 Xinwei Cai , Xiangyu Ke , Kai Wang , Lu Chen , Tianming Zhang , Qing Liu , Yunjun Gao