Results 1 to 10 of about 831,238 (272)
Distances between States and between Predicates [PDF]
Logical Methods in Computer Science, 2020 This paper gives a systematic account of various metrics on probability distributions (states) and on predicates. These metrics are described in a uniform manner using the validity relation between states and predicates.
Bart Jacobs, Abraham Westerbaan
doaj +2 more sources
Concurrency and Probability: Removing Confusion, Compositionally [PDF]
Logical Methods in Computer Science, 2019 Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to resolve decisions by drawing from some probability distribution.
Roberto Bruni +2 more
doaj +2 more sources
5000 ppm F (1.1% NaF) toothpastes – current state of knowledge
Journal of Stomatology, 2016 Leopold Wagner
openaire +3 more sources
Playing with Repetitions in Data Words Using Energy Games [PDF]
Logical Methods in Computer Science, 2020 We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables ranging over an ...
Diego Figueira +2 more
doaj +1 more source
Forward Analysis for WSTS, Part III: Karp-Miller Trees [PDF]
Logical Methods in Computer Science, 2020 This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and "Forward Analysis for WSTS, Part II: Complete WSTS" [Logical Methods in Computer Science 8(3), 2012].
Michael Blondin +2 more
doaj +1 more source
Characterization theorem for the conditionally computable real functions [PDF]
Logical Methods in Computer Science, 2017 The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains.
Ivan Georgiev
doaj +1 more source
Banach Spaces as Data Types [PDF]
Logical Methods in Computer Science, 2011 We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space.
Dag Normann
doaj +1 more source
Turing machines on represented sets, a model of computation for Analysis [PDF]
Logical Methods in Computer Science, 2011 We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis.
Nazanin Tavana, Klaus Weihrauch
doaj +1 more source
Existence of strongly proper dyadic subbases [PDF]
Logical Methods in Computer Science, 2017 We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets.
Yasuyuki Tsukamoto
doaj +1 more source
Interactive Small-Step Algorithms I: Axiomatization [PDF]
Logical Methods in Computer Science, 2007 In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms.
Andreas Blass +3 more
doaj +1 more source