Results 41 to 50 of about 10,140 (309)
Knowledge to Manage the Knowledge Society: The Concept of Theoretical Incompleteness
Systems, 2016 After having outlined the essential differences between non-complex systems and complex systems we briefly recall the conceptual approaches considered by the pre-complexity General Systems Theory introduced by Von Bertalanffy in 1968 and those of the ...
Gianfranco Minati
doaj +1 more source
Equivalence Problems for Tree Transducers: A Brief Survey [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (
Sebastian Maneth
doaj +1 more source
Who Decides Who Decides? [PDF]
The Hastings Center Report, 1977 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/90544/1/3561853 ...
openaire +3 more sources
Completing the picture for the Skolem Problem on order-4 linear recurrence sequences [PDF]
TheoretiCSFor almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem Problem is indeed
Piotr Bacik
doaj +1 more source
Decidability for some justification logics with negative introspection [PDF]
, 2013 Justification logics are modal logics that include justifications for the agent's knowledge. So far, there are no decidability results available for justification logics with negative introspection.
Studer, Thomas
core +3 more sources
Decidability via the tilting correspondence [PDF]
, 2022 We prove a relative decidability result for perfectoid fields. This applies to show that the fields $\mathbb{Q}_p(p^{1/p^{\infty}})$ and $\mathbb{Q}_p(\zeta_{p^{\infty}})$ are (existentially) decidable relative to the perfect hull of $ \mathbb{F}_p(\!(t)\
Kartas, Konstantinos
core +1 more source
Decidability of trajectory-based equations [PDF]
, 2005 We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the operations of concatenation, insertion, shuffle, quotient, sequential and ...
Domaratzki, Michael +3 more
core +1 more source
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties [PDF]
, 2022 Hyperproperties are properties of systems that relate different executions traces, with many applications from security to symmetry, consistency models of concurrency, etc.
Sanchez C., Peron A., Bozzelli L.
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Decidability vs. undecidability. Logico-philosophico-historical remarks [PDF]
, 2015 The aim of the paper is to present the decidability problems from a philosophical and historical perspective as well as to indicate basic mathematical and logical results concerning (un)decidability of particular theories and ...
Murawski, Roman
core +1 more source