Related papers: Ordered Black Boxes: Existence
We shall deal comprehensively with Black Boxes, the intention being that provably in ZFC we have a sequence of guesses of extra structure on small subsets, where the guesses are pairwise almost disjoint; by this we mean they have quite…
Probabilistic numerics casts numerical tasks, such the numerical solution of differential equations, as inference problems to be solved. One approach is to model the unknown quantity of interest as a random variable, and to constrain this…
In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated independently or sequentially. The present work proposes and compares two strategies to…
Binary classifiers are traditionally studied by propositional logic (PL). PL can only represent them as white boxes, under the assumption that the underlying Boolean function is fully known. Binary classifiers used in practical applications…
In the 1980s a new, extraordinarily productive way of reasoning about algorithms emerged. In this paper, we introduce the term "outcome reasoning" to refer to this form of reasoning. Though outcome reasoning has come to dominate areas of…
In backgrounds with compact dimensions there may exist several phases of black objects including the black-hole and the black-string. The phase transition between them raises puzzles and touches fundamental issues such as topology change,…
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…
Black-box optimization refers to the optimization problem whose objective function and/or constraint sets are either unknown, inaccessible, or non-existent. In many applications, especially with the involvement of humans, the only way to…
Access to modern generative systems is often restricted to querying an API (the ``black-box" setting) and many properties of the system are unknown to the user at inference time. While recent work has shown that low-dimensional…
Black holes represent outstanding astrophysical laboratories to test the strong gravity regime, since alternative theories of gravity may predict black hole solutions whose may differ distinctly from those of General Relativity. When higher…
In the last years many accurate decision support systems have been constructed as black boxes, that is as systems that hide their internal logic to the user. This lack of explanation constitutes both a practical and an ethical issue. The…
We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…
Following a short account of the history of the idea of black holes, we present a review of the current status of the search for observational evidence of their existence aimed at an audience of relativists rather than astronomers or…
We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…
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.…
By jagged partitions we refer to an ordered collection of non-negative integers $(n_1,n_2,..., n_m)$ with $n_m\geq p$ for some positive integer $p$, further subject to some weakly decreasing conditions that prevent them for being genuine…
The quantum statistics of charged, extremal black holes is investigated beginning with the hypothesis that the quantum state is a functional on the space of closed three-geometries, with each black hole connected to an oppositely charged…
Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…
Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…