English
Related papers

Related papers: Effective inseparability and some applications in …

200 papers

This paper aims to introduce the concept of nilpotency and capability in multiplicative Lie algebras. Also, we see the existence of covers of a multiplicative Lie algebra and thoroughly examine their relationships with capable and perfect…

Group Theory · Mathematics 2023-05-30 Amit Kumar , Mani Shankar Pandey , Sumit Kumar Upadhyay

We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…

Logic in Computer Science · Computer Science 2013-07-16 Alexis Bernadet , Stéphane Graham-Lengrand

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…

Logic · Mathematics 2018-11-05 Chitat Chong , Wei Li , Wei Wang , Yue Yang

Measurement incompatibility is one of the basic aspects of quantum theory. Here we study the structure of the set of compatible -- i.e. jointly measurable -- measurements. We are interested in whether or not there exist compatible…

Quantum Physics · Physics 2020-07-01 Paul Skrzypczyk , Matty J. Hoban , Ana Belén Sainz , Noah Linden

Uncertainty relations provide constraints on how well the outcomes of incompatible measurements can be predicted, and, as well as being fundamental to our understanding of quantum theory, they have practical applications such as for…

Quantum Physics · Physics 2013-05-30 Patrick J. Coles , Roger Colbeck , Li Yu , Michael Zwolak

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…

Cryptography and Security · Computer Science 2021-11-09 Mohammad Zeynali Azim , Saeid Alikhani , Babak Anari

We investigate entropic uncertainty relations for two or more binary measurements, for example spin-$\frac{1}{2}$ or polarisation measurements. We argue that the effective anti-commutators of these measurements, i.e. the anti-commutators…

Quantum Physics · Physics 2014-07-30 Jędrzej Kaniewski , Marco Tomamichel , Stephanie Wehner

Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information…

Information Theory · Computer Science 2010-11-22 Nihat Ay , Markus Mueller , Arleta Szkola

We introduce a set of eight universal Rules of Inference by which computer programs with known properties (axioms) are transformed into new programs with known properties (theorems). Axioms are presented to formalize a segment of Number…

Logic in Computer Science · Computer Science 2007-05-23 Charlie Volkstorf

I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…

History and Philosophy of Physics · Physics 2021-04-14 Sebastian De Haro

We exhibit a way of "forcing a functional to be an effective operation" for arbitrary partial combinatory algebras (pcas). This gives a method of defining new pcas from old ones for some fixed functional, where the new partial functions can…

Logic · Mathematics 2014-08-22 Eric Faber , Jaap van Oosten

One of the most annoying aspects in the formalization of mathematics is the need of transforming notions to match a given, existing result. This kind of transformations, often based on a conspicuous background knowledge in the given…

Logic in Computer Science · Computer Science 2010-05-04 Andrea Asperti , Enrico Tassi

We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…

Logic · Mathematics 2023-10-26 Benno van den Berg

Indeterminacy associated with probing of a quantum state is commonly expressed through spectral distances (metric) featured in the outcomes of repeated experiments. Here we express it as an effective amount (measure) of distinct outcomes…

Quantum Physics · Physics 2021-09-21 Ivan Horváth

Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…

Quantum Physics · Physics 2010-08-16 Andreas Gabriel , Beatrix C. Hiesmayr , Marcus Huber

This paper establishes grounds for deeper exploration into the question of dual nature of mathematics as an abstract discipline and as a concrete science. It is argued, as one of the consequences of the discussion, that the division into…

General Mathematics · Mathematics 2016-12-14 Radoslav Dimitric

Effective field theories include contact-range interactions (or counterterms) for two reasons: representing the unknown short-range physics in a model independent manner and ensuring the cutoff independence of observables. Both are…

Nuclear Theory · Physics 2026-04-14 Manuel Pavon Valderrama

This review summarizes Effective Field Theory techniques, which are the modern theoretical tools for exploiting the existence of hierarchies of scale in a physical problem. The general theoretical framework is described, and explicitly…

High Energy Physics - Theory · Physics 2008-11-26 C. P. Burgess

We consider a new identity involving integrals and sums of Bessel functions. The identity provides new ways to evaluate integrals of products of two Bessel functions. The identity is remarkably simple and powerful since the summand and…

Classical Analysis and ODEs · Mathematics 2014-08-20 Diego E. Dominici , Peter M. W. Gill , Taweetham Limpanuparb

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.

Computational Complexity · Computer Science 2007-05-23 Harry Buhrman , Tao Jiang , Ming Li , Paul Vitanyi
‹ Prev 1 4 5 6 7 8 10 Next ›