Related papers: Robin Milner's Work on Concurrency: An Appreciatio…
Analogues of Kolmogorov comparison theorems and some of their applications were established.
Lebesgue's dominated convergence theorem is a crucial pillar of modern analysis, but there are certain areas of the subject where this theorem is deficient. Deeper criteria for convergence of integrals are described in this article.
Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such…
Proper scoring rules are methods for encouraging honest assessment of probability distributions. Just like likelihood, a proper scoring rule can be applied to supply an unbiased estimating equation for any statistical model, and the theory…
Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on…
We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to…
There has been a lively debate in many fields, including statistics and related applied fields such as psychology and biomedical research, on possible reforms of the scholarly publishing system. Currently, referees contribute so much to…
Not only did Turing help found one of the most exciting areas of modern science (computer science), but it may be that his contribution to our understanding of our physical reality is greater than we had hitherto supposed. Here I explore…
A competitive learning model was introduced in Ref. 1 (A. Mehta and J. M. Luck, Phys. Rev. E 60, 5, 1999), in which the learning is outcome-related. Every individual chooses between a pair of existing strategies or types, guided by a…
We study model-agnostic copies of machine learning classifiers. We develop the theory behind the problem of copying, highlighting its differences with that of learning, and propose a framework to copy the functionality of any classifier…
Diseases spread over temporal networks of interaction events between individuals. Structures of these temporal networks hold the keys to understanding epidemic propagation. One early concept of the literature to aid in discussing these…
Diese kurze Einfuehrung in Theorie und Berechnung linearer Rekurrenzen versucht, eine Luecke in der Literatur zu fuellen. Zu diesem Zweck sind viele ausfuehrliche Beispiele angegeben. This short introduction to theory and usage of linear…
This paper, which is dedicated to Alan Turing on the 50th anniversary of his death, gives an overview and discusses the philosophical implications of incompleteness, uncomputability and randomness.
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…
We investigate the interaction between the product of invariant types and domination-equivalence. We present a theory where the latter is not a congruence with respect to the former, provide sufficient conditions for it to be, and study the…
Are existing ways of measuring scientific quality reflecting disadvantages of not being part of giant collaborations? How could possible discrimination be avoided? We propose indices defined for each discipline (subfield) and which count…
The paper introduces notions of robustness margins geared towards the analysis and design of systems that switch and oscillate. While such phenomena are ubiquitous in nature and in engineering, a theory of robustness for behaviors away from…
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True…
Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algoritm. In this paper, an attempt is made to generalize the…
An important issue in concurrency is interference. This issue manifests itself in both shared-variable and communication-based concurrency --- this paper focusses on the former case where interference is caused by the environment of a…