Publications

Order By: Most citations

It is shown that the parity game can be solved in quasipolynomial time. The parameterised parity game (with n nodes and m distinct values) is proven to be in the class of fixed parameter tractable (FPT) problems (when parameterised over m). Both results improve known bounds, from runtime n O( p n/ log(n)) to O(n log(m)+6 ) (note that m n) and from an XP-algorithm with runtime O(n ⇥(m) ) for fixed parameter m to an FPT-algorithm with runtime O(n 5 ) + g(m), for some function g depending on m only. As an application it is proven that coloured Muller games with n nodes and m colours can be decided in time O((m m • n) 5 ); this bound cannot be improved to O((2 m • n) c ), for any c, unless FPT = W[1].

International audienceVery large databases are a ma jor opp ortunity for science and data analytics is a remarkable new field of investigation in computer science. The effectiveness of these toolsis used to support a “philosophy” against the scientific method as developed throughout history. According to this view, computer-discovered correlations should replace understanding and guide prediction and action. Consequently, there will be no need to givescientific meaning to phenomena, by proposing, say, causal relations, since regularities in very large databases are enough: “with enough data, the numbers speak for themselves”. The “end of science” is proclaimed. Using classical results from ergodic theory, Ramsey theory and algorithmic information theory, we show that this “philosophy” is wrong. For example, we prove that very large databases have to contain arbitrary correlations. These correlations appear only due to the size, not the nature, of data. They can be found in “randomly” generated, large enough databases, which - as we will prove - implies that most correlations are spurious. Too much information tends to behave like very little information. The scientific method can be enriched by computer mining in immense databases, but not replaced by it

The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is non-contextual and consistent with quantum mechanics. If we require non-contextuality, the consequence is that many observables must not have pre-existing definite values. However, the Kochen-Specker theorem does not allow one to determine which observables must be value indefinite. In this paper we present an improvement on the Kochen-Specker theorem which allows one to actually locate observables which are provably value indefinite. Various technical and subtle aspects relating to this formal proof and its connection to quantum mechanics are discussed. This result is then utilized for the proposal and certification of a dichotomic quantum random number generator operating in a three-dimensional Hilbert space.Comment: 31 pages, 5 figures, final versio

Abstract. A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay 23 and Chaitin 10 we s a y that an r.e. real dominates an r.e. real if from a good approximation of from below one can compute a good approximation of from below. We shall study this relation and characterize it in terms of relations between r.e. sets. Solovay's 23 -like numbers are the maximal r.e. real numbers with respect to this order. They are random r.e. real numbers. The halting probability o f a universal self-delimiting Turing machine Chaitin's number, 9 is also a random r.e. real. Solovay showed that any Chaitin numberis -like. In this paper we show that the converse implication is true as well: any -like real in the unit interval is the halting probability of a universal self-delimiting Turing machine.

The aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Halting Problem. Our approach is to have the probability space extend over both space and time and to consider the probability that a random N -bit program has halted by a random time. We postulate an a priori computable probability distribution on all possible runtimes and we prove that given an integer k > 0, we can effectively compute a time bound T such that the probability that an N -bit program will eventually halt given that it has not halted by T is smaller than 2 −k .We also show that the set of halting programs (which is computably enumerable, but not computable) can be written as a disjoint union of a computable set and a set of effectively vanishing probability.Finally, we show that "long" runtimes are effectively rare. More formally, the set of times at which an N -bit program can stop after the time 2 N + constant has effectively zero density.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.