Related papers: Ordered Black Boxes: Existence
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The…
Colour vision has long fascinated scientists, who have sought to understand both the physiology of the mechanics of colour vision and the psychophysics of colour perception. We consider representations of colour in anatomically constrained…
Frequently, the burgeoning field of black-box optimization encounters challenges due to a limited understanding of the mechanisms of the objective function. To address such problems, in this work we focus on the deterministic concept of…
The definition of order indices for density matrices is extended to finite systems. This makes it possible to characterize the level of ordering in such finite systems as macromolecules, nanoclusters, quantum dots, or trapped atoms. The…
Counterfactual post-hoc interpretability approaches have been proven to be useful tools to generate explanations for the predictions of a trained blackbox classifier. However, the assumptions they make about the data and the classifier make…
We give an explicit prescription for experimentally determining the evolution operators which completely describe the dynamics of a quantum mechanical black box -- an arbitrary open quantum system. We show necessary and sufficient…
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…
We introduce a method based on Conformal Prediction (CP) to quantify the uncertainty of full ranking algorithms. We focus on a specific scenario where $n+m$ items are to be ranked by some ``black box'' algorithm. It is assumed that the…
We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
A new class of test functions for black box optimization is introduced. Affine OneMax (AOM) functions are defined as compositions of OneMax and invertible affine maps on bit vectors. The black box complexity of the class is upper bounded by…
Black holes are perhaps the most strange and fascinating objects known to exist in the universe. Our understanding of space and time is pushed to its limits by the extreme conditions found in these objects. They can be used as natural…
The three-box problem is a gedankenexperiment designed to elucidate some interesting features of quantum measurement and locality. A particle is prepared in a particular superposition of three boxes, and later found in a different (but…
Recent developments in the study of primordial black holes (PBHs) are reviewed, with particular emphasis on their formation and evaporation. It is still not clear whether PBHs formed but, if they did, they could provide a unique probe of…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
A common problem, arising in many different applied contexts, consists in estimating the number of exponentially damped sinusoids whose weighted sum best fits a finite set of noisy data and in estimating their parameters. Many different…
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
The problem of characterizing normed ordered spaces which admit a representation in the algebraic, order and norm sense as a subspace of $C(X)$, the space of all continuous functions on a compact Hausdorff space is a classical problem that…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…