Related papers: Effective Martingales with Restricted Wagers
We develop a correspondence between the theory of sequential algorithms and classical reasoning, via Kreisel's no-counterexample interpretation. Our framework views realizers of the no-counterexample interpretation as dynamic processes…
Supermartingales are here defined on a non-probabilistic setting and can be interpreted solely in terms of superhedging operations. The classical expectation operator is replaced by a pair of subadditive operators one of them providing a…
We give optimal convergence rates in the central limit theorem for a large class of martingale difference sequences with bounded third moments. The rates depend on the behaviour of the conditional variances and for stationary sequences the…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
The martingale method is used to establish concentration inequalities for a class of dependent random sequences on a countable state space, with the constants in the inequalities expressed in terms of certain mixing coefficients. Along the…
We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…
A large branch of explainable machine learning is grounded in cooperative game theory. However, research indicates that game-theoretic explanations may mislead or be hard to interpret. We argue that often there is a critical mismatch…
In his book entitled ''A System of Logic, Ratiocinative and Inductive'' (1843), John Stuart Mill proposed principles of inductive reasoning in the form of five canons. To date, these canons are classic methods for causal reasoning: they are…
This paper presents a novel approach to analyze human decision-making that involves comparing the behavior of professional chess players relative to a computational benchmark of cognitively bounded rationality. This benchmark is constructed…
A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…
In this paper non-asymptotic exponential estimates are derived for tail of maximum martingale distribution by naturally norming in the spirit of the classical Law of Iterated Logarithm. Key words: Martingales, exponential estimations,…
Generalization of the Lambalgen's theorem is studied with the notion of Hippocratic (blind) randomness without assuming computability of conditional probabilities. In [Bauwence 2014], a counter-example for the generalization of Lambalgen's…
I defend an analog of probabilism that characterizes rationally coherent estimates for chances. Specifically, I demonstrate the following accuracy-dominance result for stochastic theories in the C*-algebraic framework: supposing an…
We consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (compute the task) or not (return a bogus result to save the…
Martingales constitute a basic tool in stochastic analysis; this paper considers their application to counting processes. We use this tool to revisit a renewal theorem and its extensions for various counting processes. We first consider a…
Given a sequence $(M^n)^{\infty}_{n=1}$ of nonnegative martingales starting at $M^n_0=1$, we find a sequence of convex combinations $(\widetilde{M}^n)^{\infty}_{n=1}$ and a limiting process $X$ such that…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…