Related papers: On quantification with a finite universe
This is a further explanation of a new and simple renormalization approach recently proposed by the author (hep-th/9708104, Ref. [1], that is somewhat sketchy) for any ordinary QFT (whether renormalizable or not) in any spacetime dimension.…
In this survey article we give basic introduction to the theory of quantum families of maps. We begin with a general look at non-commutative (or "quantum") topology. Then we formulate all our results in this language. Existence of quantum…
We argue that if de Sitter space is indeed represented by a finite dimensional quantum system, then semi-classical considerations, combined with the fundamental principles of quantum measurement theory, imply that any theoretical model of…
Quantum cosmology is the quantum theory of the entire universe. Although strange at first sight, it is appropriate because (1) our world appears to be fundamentally quantum, (2) the classical description of gravity breaks down at…
Quantum cosmology in general denotes the application of quantum physics to the whole universe and thus gives rise to many realizations and examples, covering problems at different mathematical and conceptual levels. It is related to quantum…
A new approach is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the nowaday's standard…
Quantification, i.e., the task of training predictors of the class prevalence values in sets of unlabeled data items, has received increased attention in recent years. However, most quantification research has concentrated on developing…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of…
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…
By a use of the Fredholm determinant theory, the unified quantum entropy notion has been extended to a case of infinite-dimensional systems. Some of the known (in the finite-dimensional case) basic properties of the introduced unified…
A series of successive quantizations is considered, starting with the quantization of a non relativistic or relativistic point particle: 1) quantization of a particle's position, 2) quantization of wave function, 3) quantization of wave…
In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…
The notion of quantum information related to the two different perspectives of the global and local states is examined. There is circularity in the definition of quantum information because we can speak only of the information of systems…
We study the third quantization of the Friedmann-Robertson-Walker cosmology with $N$-minimal massless fields. The third quantized Hamiltonian for the WDW equation in the minisuperspace consists of infinite number of intrinsic…
Families of operator identities appeared as a consequence of an existence of finite-dimensional representation of (super) Lie algebras of first-order differential operators and $q$-deformed (quantum) algebras of first-order…
We introduce the concept of K-th order chaoticity of unitaries, and analyze it for the case of two-level quantum systems. This property is relevant in a certain quantum random number generation scheme. We show that no unitaries exist with…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…
We describe all closed permutation groups which act on the set of vectors of a countable vector space $V$ over a prime field of odd order and which contain all automorphisms of $V$. In particular, we prove that their number is finite. These…