English
Related papers

Related papers: Undecidability everywhere?

200 papers

The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to…

Logic in Computer Science · Computer Science 2016-07-07 Prateek Karandikar , Philippe Schnoebelen

We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.

General Topology · Mathematics 2007-09-19 Liljana Babinkostova , Marion Scheepers

Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…

Logic · Mathematics 2015-06-11 Maokang Luo , Wei He

We present a propositional logic %which can be used to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed experiments in the proof assistant Coq that are reported here.

Computer Science and Game Theory · Computer Science 2008-12-18 Pierre Lescanne

It is shown that the compositum $ \mathbb Q^{(2)}$ of all degree 2 extensions of $\mathbb Q$ has undecidable theory.

Logic · Mathematics 2020-11-03 Carlos Martinez-Ranero , Javier Utreras , Carlos R. Videla

Prediction is a complex notion, and different predictors (such as people, computer programs, and probabilistic theories) can pursue very different goals. In this paper I will review some popular kinds of prediction and argue that the theory…

Machine Learning · Computer Science 2007-05-23 Vladimir Vovk

A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…

Uncertainty relations for particle motion in curved spaces are discussed. The relations are shown to be topologically invariant. New coordinate system on a sphere appropriate to the problem is proposed. The case of a sphere is considered in…

Quantum Physics · Physics 2008-11-26 A. V. Golovnev , L. V. Prokhorov

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…

Quantum Physics · Physics 2009-12-06 Caslav Brukner

A source of unpredictability is equivalent to a source of information: unpredictability means not knowing which of a set of alternatives is the actual one; determining the actual alternative yields information. The degree of…

chao-dyn · Physics 2008-02-03 Carlton M. Caves , Ruediger Schack

We derive axiomatically the probability function that should be used to make decisions given any form of underlying uncertainty.

Artificial Intelligence · Computer Science 2013-04-08 Philippe Smets

This paper reviews connections between physics and computation, and explores their implications. The main topics are computational "hardness" of physical systems, computational status of fundamental theories, quantum computation, and the…

Logic · Mathematics 2007-05-23 Joseph Shipman

For any ideal two-path interferometer it is shown that the wave-particle duality of quantum mechanics implies Heisenberg's uncertainty relation and vice versa. It is conjectured that complementarity and uncertainty are two aspects of the…

Quantum Physics · Physics 2007-05-23 Ole Steuernagel

One of the most interesting questions concerning hierarchical control of discrete-event systems with partial observations is a condition under which the language observability is preserved between the original and the abstracted plant.…

Systems and Control · Computer Science 2012-01-10 Tomáš Masopust

We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability…

Logic in Computer Science · Computer Science 2014-01-27 Yangjia Li , Mingsheng Ying

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

Computational Complexity · Computer Science 2023-10-18 Matthias C. Caro

I discuss some of the main interpretations given to explain the indeterministic nature of quantum measurements and show that all has some loopholes in one corner or another. I propose an alternative interpretation based on the notion of…

Quantum Physics · Physics 2009-09-30 M. B. Altaie

Given entropy's central role in multiple areas of physics and science, one important task is to develop a systematic and unifying approach to defining entropy. Games of chance become a natural candidate for characterising the uncertainty of…

Quantum Physics · Physics 2022-02-23 Sarah Brandsen , Isabelle Jianing Geng , Gilad Gour

We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and complete axiomatization…

Artificial Intelligence · Computer Science 2014-08-08 Joseph Y. Halpern , Riccardo Pucella
‹ Prev 1 4 5 6 7 8 10 Next ›