Results 41 to 50 of about 839,098 (257)
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties [PDF]
Logical Methods in Computer Science, 2016 The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to be correct, but
John Case, Michael Ralston
doaj +1 more source
New Tools for Cellular Automata in the Hyperbolic Plane
Journal of universal computer science (Online), 2000 In this paper, we introduce a new technique in order to deal with cellular automata in the hyperbolic plane. The subject was introduced in [7] which gave an important application of the new possibility opened by the rst part of that paper.
M. Margenstern
semanticscholar +1 more source
The ESO Spectroscopic facility [PDF]
, 2017 We present the concept of a novel facility dedicated to massively-multiplexed spectroscopy. The telescope has a very wide field Cassegrain focus optimised for fibre feeding. With a Field of View (FoV) of 2.5 degrees diameter and a 11.4m pupil, it will be
Cavaller, L. +5 more
core +3 more sources
Neighbourhood Structures: Bisimilarity and Basic Model Theory [PDF]
Logical Methods in Computer Science, 2009 Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic.
Helle Hvid Hansen +2 more
doaj +1 more source
Acupuncture in Medicine, 2019 Objectives: To test whether a newly developed person-, theory- and evidence-based website about acupuncture helps patients make informed decisions about whether or not to use acupuncture for back pain.
F. Bishop +9 more
semanticscholar +1 more source
Enriched MU-Calculi Module Checking [PDF]
Logical Methods in Computer Science, 2008 The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate
Alessandro Ferrante +2 more
doaj +1 more source
EXPTIME Tableaux for the Coalgebraic mu-Calculus [PDF]
Logical Methods in Computer Science, 2011 The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic.
Corina Cirstea +2 more
doaj +1 more source
Towards a Minimal Stabilizer ZX-calculus [PDF]
Logical Methods in Computer Science, 2020 The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram into another one using the graphical rewrite rules if and only if these two ...
Miriam Backens +2 more
doaj +1 more source
On a possibility of adjoint colored states condensation at finite temperatures in lattice gauge model [PDF]
, 1999 Cooled down and diluted quark-gluon matter is considered. A possibility of condensation of multiquark clusters with zero N-alities is discussed.Comment: Lattice99:Finite Temperature and Density ...
Boyd +9 more
core +2 more sources
Computational Models of Certain Hyperspaces of Quasi-metric Spaces [PDF]
Logical Methods in Computer Science, 2011 In this paper, for a given sequentially Yoneda-complete T_1 quasi-metric space (X,d), the domain theoretic models of the hyperspace K_0(X) of nonempty compact subsets of (X,d) are studied.
Massoud Pourmahdian, Mahdi Ali-Akbari
doaj +1 more source