Results 241 to 250 of about 2,141 (287)
A Categorical Model of General Consciousness. [PDF]
Biomimetics (Basel)Zhang Y.
europepmc +1 more source
Theoretical Computer Science, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klaus-Jörn Lange
exaly +3 more sources
Lecture Notes in Computer Science, 2006 We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs involving arbitrary higher levels of the relativized unambiguous polynomial hierarchy (UPH).
Rahul Tripathi, Holger Spakowski
exaly +5 more sources
On the Power of Unambiguity in Alternating Machines
Lecture Notes in Computer Science, 2005 Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of efficient protocols involving globally-unique games by Crâsmaru et al. [CGRS04].
Rahul Tripathi, Holger Spakowski
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Revisiting unambiguous discrimination
Quantum Information Processing, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wen-Hai Zhang +3 more
openaire +3 more sources
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
Theory of Computing Systems, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoine Mottet, Karin Quaas
openaire +3 more sources
Making nondeterminism unambiguous
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2000Summary: We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as \[ \begin{aligned} \text{NL/poly} &= \text{UL/poly},\\ \text{LogCFL ...
Klaus Reinhardt, Eric Allender
openaire +3 more sources
Sequentialization and Unambiguity of (Max,+) Rational Series Over One Letter
IFAC Postprint Volumes IPPV / International Federation of Automatic Control, 2001 International audienceWe present an algorithm to decide whether a (max,+)-rational series over one letter is sequential.
Lombardy, Sylvain
exaly +2 more sources
Unambiguous Functions in Logarithmic Space [PDF]
Fundamenta Informaticae, 2012 We investigate different variants of unambiguity in the context of computing multi-valued functions. We propose a modification to the standard computation models of Turing machines and configuration graphs, which allows for unambiguity-preserving composition.
Grzegorz Herman, Michael Soltys
openaire +2 more sources
Noûs, 1987
Recently, Allan Gibbard has argued that there is a semantic difference between indicative and subjunctive conditional sentences. His arguments, which derive in part from the work of E.W. Adams (see [1] and [2] for example), are presented in detail in [3].
openaire +1 more source
Recently, Allan Gibbard has argued that there is a semantic difference between indicative and subjunctive conditional sentences. His arguments, which derive in part from the work of E.W. Adams (see [1] and [2] for example), are presented in detail in [3].
openaire +1 more source