Related papers: Black Boxes
We study the computational complexity of fair division of indivisible items in an enriched model: there is an underlying graph on the set of items. And we have to allocate the items (i.e., the vertices of the graph) to a set of agents in…
We consider a deterministic game with alternate moves and complete information, of which the issue is always the victory of one of the two opponents. We assume that this game is the realization of a random model enjoying some independence…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
In Newcomb's paradox you choose to receive either the contents of a particular closed box, or the contents of both that closed box and another one. Before you choose, a prediction algorithm deduces your choice, and fills the two boxes based…
The Primordial Black Holes (PBHs) are gradually involved into consideration as the phenomenon having reliable basis. We discuss here the possibility of their agglomeration into clusters that may have several prominent observable features.…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
Chaos in the orbits of black hole pairs has by now been confirmed by several independent groups. While the chaotic behavior of binary black hole orbits is no longer argued, it remains difficult to quantify the importance of chaos to the…
We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…
Black holes are extremely relativistic objects. Physical processes around them occur in a regime where the gravitational field is extremely intense. Under such conditions, our representations of space, time, gravity, and thermodynamics are…
Interpretability has become incredibly important as machine learning is increasingly used to inform consequential decisions. We propose to construct global explanations of complex, blackbox models in the form of a decision tree…
In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…
In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…
We discuss and compare definitions of a black hole based on the existence of event and apparent horizons. In this connection we present a non-singular model of a black hole with a closed apparent horizon and discuss its properties. We…
We give several partial positive answers to a question of Juhasz and Szentmiklossy regarding the minimum number of discrete sets required to cover a compact space. We study the relationship between the size of discrete sets, free sequences…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…
Exactly 20 years ago at MFCS, Demaine posed the open problem whether the game of Dots & Boxes is PSPACE-complete. Dots & Boxes has been studied extensively, with for instance a chapter in Berlekamp et al. "Winning Ways for Your Mathematical…
An attempt is made in order to clarify the so called regular black holes issue. It is revisited that if one works within General Relativity minimally coupled with non linear source, mainly of electromagnetic origin, and within a static…