Related papers: Ordered Black Boxes: Existence
Neural networks are commonly regarded as black boxes performing incomprehensible functions. For classification problems networks provide maps from high dimensional feature space to K-dimensional image space. Images of training vector are…
Black holes are defined as a region in spacetime where gravity is so strong that particles and electromagnetic radiation cannot escape. According to their mass, they are classified into three types: stellar-mass black holes,…
A relativistic framework for the description of bound states consisting of a large number of quantum constituents is presented, and applied to black-hole interiors. At the parton level, the constituent distribution, number and energy…
In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas…
This paper is a compressed summary of some principal definitions and concepts in the approach to the black box algebra being developed by the authors. We suggest that black box algebra could be useful in cryptanalysis of homomorphic…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
This work advances knowledge of the threshold of prox-boundedness of a function; an important concern in the use of proximal point optimization algorithms and in determining the existence of the Moreau envelope of the function. In finite…
We point out that neural networks are not black boxes, and their generalization stems from the ability to dynamically map a dataset to the extrema of the model function. We further prove that the number of extrema in a neural network is…
Black holes are by definition black, and therefore cannot be directly observed by using electromagnetic radiations. Convincing identification of black holes must necessarily depend on the identification of a very specially behaving matter…
In this paper we present the status of the physics of Planck scale black holes with particular reference to their conjectured production in particle accelerator experiments at the terascale. After reviewing some open issues of fundamental…
In this paper we present the following two results: we give an explicit description of the space of orderings of the field Q(x) as an inverse limit of finite spaces of orderings and we provide a new, simple proof of the fact that the class…
The article summarizes the observational evidence for the existence of massive black holes, as well as the current knowledge about their abundance, their mass and spin distributions, and their cosmic evolution within and together with their…
We identify the stochastic processes associated with one-sided fractional partial differential equations on a bounded domain with various boundary conditions. This is essential for modelling using spatial fractional derivatives. We show…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…
Aspects of primordial black holes, i.e. black holes formed in the early Universe, are reviewed. Special emphasis is put on their formation, their role as dark matter candidates and their manifold signatures, particularly through…
Black-box optimization is often encountered for decision-making in complex systems management, where the knowledge of system is limited. Under these circumstances, it is essential to balance the utilization of new information with…
In order to give appropriate semantics to qualitative conditionals of the form "if A then normally B", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting…
Black-box complexity studies lower bounds for the efficiency of general-purpose black-box optimization algorithms such as evolutionary algorithms and other search heuristics. Different models exist, each one being designed to analyze a…
When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…