Anonymity in Predicting the Future

Dvij Bajpai; Daniel J. Velleman

Home/Archive/arXiv

arXiv · 1508.06865

Anonymity in Predicting the Future

Dvij Bajpai·Daniel J. Velleman

View original source ↗Read source document ↗Export metadata ↓

Abstract

Consider an arbitrary set $S$ and an arbitrary function $f : \mathbb{R} \to S$. We think of the domain of $f$ as representing time, and for each $x \in \mathbb{R}$, we think of $f(x)$ as the state of some system at time $x$. Imagine that, at each time $x$, there is an agent who can see $f \upharpoonright (-\infty, x)$ and is trying to guess $f(x)$--in other words, the agent is trying to guess the present state of the system from its past history. In a 2008 paper, Christopher Hardin and Alan Taylor use the axiom of choice to construct a strategy that the agents can use to guarantee that, for every function $f$, all but countably many of them will guess correctly. In a 2013 monograph they introduce the idea of anonymous guessing strategies, in which the agents can see the past but don't know where they are located in time. In this paper we consider a number of variations on anonymity. For instance, what if, in addition to not knowing where they are located in time, agents also do not know the rate at which time is progressing? What if they have no sense of how much time elapses between any two events? We show that in some cases agents can still guess successfully, while in others they perform very poorly.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Dvij Bajpai, Daniel J. Velleman. 2015-08-27. Anonymity in Predicting the Future. https://arxiv.org/abs/1508.06865

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗