Results 121 to 130 of about 475,794 (375)
Delta-Decidability over the Reals
2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012 Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any sentence A containing only bounded quantifiers and functions in F, and any positive rational number delta, decides either “A is true ...
Sicun Gao, J. Avigad, E. Clarke
semanticscholar +1 more source
Molecular Oncology, EarlyView.Prostate cancer is a leading malignancy with significant clinical heterogeneity in men. An 11‐gene signature derived from dysregulated epithelial cell markers effectively predicted biochemical recurrence‐free survival in patients who underwent radical surgery or radiotherapy.
Zhuofan Mou, Lorna W. Harries
wiley +1 more source
Termination of Triangular Integer Loops is Decidable [PDF]
arXiv, 2019 We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004, only special cases have been solved. We complement this work by proving decidability for the case that the update matrix is triangular.
arxiv
Extended Regular Expressions: Succinctness and Decidability
Theory of Computing Systems, 2012 Most modern implementations of regular expression engines allow the use of variables (also called backreferences). The resulting extended regular expressions (which, in the literature, are also called practical regular expressions, rewbr, or regex) are ...
Dominik D. Freydenberger
semanticscholar +1 more source
Clinical significance of stratifying prostate cancer patients through specific circulating genes
Molecular Oncology, EarlyView.We tested a specific panel of genes representative of luminal, neuroendocrine and stem‐like cells in the blood of prostate cancer patients, showing predictive value from diagnosis to late stages of disease. This approach allows monitoring of treatment responses and outcomes at specific time points in trajectories.
Seta Derderian +12 more
wiley +1 more source
Decidability in Intuitionistic Type Theory is Functionally Decidable [PDF]
Mathematical Logic Quarterly, 1996 AbstractIn this paper we show that the usual intuitionistic characterization of the decidability of the propositional function B(x) prop [x : A], i. e. to require that the predicate (∀x ∈ A) (B(x) ∨ ¬ B(x)) is provable, is equivalent, when working within the framework of Martin‐Löf's Intuitionistic Type Theory, to require that there exists a decision ...
openaire +2 more sources
General decidability theorems for infinite-state systems
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996 Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions ...
P. Abdulla +3 more
semanticscholar +1 more source
Molecular Oncology, EarlyView.In molecular cancer diagnostics, comprehensive genomic profiling (CGP) is going to replace the small NGS panels since it provides all clinically relevant somatic variants as well as genomic biomarkers with clinical value. Here, we compared two CGP assays and demonstrate that the choice for diagnostic implementation will depend on the specific ...
Guy Froyen +17 more
wiley +1 more source
Quantum computing architectures with signaling and control mimicking biological processes. [PDF]
Heliyon, 2023 Pau LF, Borza PN.
europepmc +1 more source
A SWIFT AND SIMPLE METHOD FOR DECIDING PNEUMOCOCCAL "TYPE" [PDF]
, 1931 R. R. Armstrong
openalex +1 more source