Related papers: Normality, Relativization, and Randomness
Randomness is viewed through an analogy between a physical quantity, density of gas, and a mathematical construct -- probability density. Boltzmann's deduction of equilibrium distribution of ideal gas placed in an external potential field…
Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…
In this paper we introduce and study the concept of normality degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be normal. Explicit formulas are obtained for some particular classes of…
We introduce the notion of Krull super-dimension of supermodules over certain super-commutative Noetherian super-rings. We investigate how this notion relates to the notion of odd regular sequence introduced by T.Schmitt and how it behaves…
The subject of features normalization plays an important central role in data representation, characterization, visualization, analysis, comparison, classification, and modeling, as it can substantially influence and be influenced by all of…
The elements of a deterministic quantum theory are developed, which reformulates and extends standard quantum theory. The proposed theory is `realistic' in the sense that in it, a general M-level quantum state is represented by a single…
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like. However, each of them…
We consider a conception of reality that is the following: An object is 'real' if we know that if we would try to test whether this object is present, this test would give us the answer 'yes' with certainty. If we consider a conception of…
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…
Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…
The authors lay the foundations for the study of normal families of holomorphic functions and mappings on an infinite-dimensional normed linear space. Characterizations of normal families, in terms of value distribution, spherical…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Bivariate normal distributions are often used to describe the joint probability density of a pair of random variables. These distributions arise across many domains, from telecommunications, to meteorology, ballistics, and computational…
We introduce a finite version of free probability and show the link between recent results using polynomial convolutions and the traditional theory of free probability. One tool for accomplishing this is a seemingly new transformation that…
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.
In usual dimensional counting, momentum has dimension one. But a function f(x), when differentiated n times, does not always behave like one with its power smaller by n. This inevitable uncertainty may be essential in general theory of…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
A number of generalizations of stochastic and information-theoretic randomness are known in the literature. However, they are not compatible with handling meaning in vague and dynamic contexts of rough reasoning (and therefore explainable…
Inverse problems are characterized by their inherent non-uniqueness and sensitivity with respect to data perturbations. Their stable solution requires the application of regularization methods including variational and iterative…
One of the main lines of research in algorithmic randomness is that of lowness notions. Given a randomness notion R, we ask for which sequences A does relativization to A leave R unchanged (i.e., R^A = R)? Such sequences are call low for R.…