Results 61 to 70 of about 39,716 (258)
Deciding some displayable modal logics [PDF]
arXiv, 2023 In this paper we use display calculus to show the decidability for normal modal logic K and some of its extensions.
arxiv
FEBS Letters, EarlyView.Most MmpLs transport lipids and glycolipids of the complex mycomembrane of mycobacteria. This study shows that MmpL10 from Mycobacterium smegmatis, the transporter of the trehalose polyphosphate precursor, harbors a coiled‐coil‐like extension. Biochemical and electron microscopy studies demonstrate that the coiled‐coil enables MmpL10 to trimerize.
Julie Couston +7 more
wiley +1 more source
A Decidable Extension of Data Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Data automata on data words is a decidable model proposed by Bojańczyk et al. in 2006. Class automata, introduced recently by Bojańczyk and Lasota, is an extension of data automata which unifies different automata models on data words.
Zhilin Wu
doaj +1 more source
Undecidability and Complexity for Super-Turing Models of Computation
Proceedings, 2022 It seems that intelligent complex systems will require formalisms having richer behavior than Turing machines. Very little is known about the relations (e.g., the expressiveness and/or effectiveness) between new super-Turing models of computation.
Eugene Eberbach
doaj +1 more source
Molecular Oncology, EarlyView.The number of circulating tumor cells obtained from prostate cancer patients was increased approximately 5‐fold compared to regular CellSearch when processing 2 mL diagnostic leukapheresis material aliquots and increased by 44‐fold when processing 20 mL DLA aliquots using the flow enrichment target capture Halbach‐array.
Michiel Stevens +8 more
wiley +1 more source
Well Behaved Transition Systems [PDF]
Logical Methods in Computer Science, 2017 The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem.
Michael Blondin +2 more
doaj +1 more source
Topological Semantics and Decidability [PDF]
, 2007 It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal logics of $T_0$
Sustretov, Dmitry
core +6 more sources
Generalized Post Embedding Problems
, 2014 The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions.
Karandikar, Prateek +1 more
core +1 more source
Surfaceome: a new era in the discovery of immune evasion mechanisms of circulating tumor cells
Molecular Oncology, EarlyView.In the era of immunotherapies, many patients either do not respond or eventually develop resistance. We propose to pave the way for proteomic analysis of surface‐expressed proteins called surfaceome, of circulating tumor cells. This approach seeks to identify immune evasion mechanisms and discover potential therapeutic targets. Circulating tumor cells (
Doryan Masmoudi +3 more
wiley +1 more source
Decidability Problems for Actor Systems [PDF]
Logical Methods in Computer Science, 2014 We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness.
Frank De Boer +3 more
doaj +1 more source