Results 221 to 230 of about 27,445 (253)
Some of the next articles are maybe not open access.
2010
We study the relationship between complexity cores of a language and the descriptional complexity of the characteristic sequence of the language based on Kolmogorov complexity. We prove that a recursive set A has a complexity core if for all constants c, the computational depth (the difference between time-bounded and unbounded Kolmogorov ...
openaire +1 more source
We study the relationship between complexity cores of a language and the descriptional complexity of the characteristic sequence of the language based on Kolmogorov complexity. We prove that a recursive set A has a complexity core if for all constants c, the computational depth (the difference between time-bounded and unbounded Kolmogorov ...
openaire +1 more source
Kolmogorov Complexity with Error
2006We introduce the study of Kolmogorov complexity with error. For a metric d, we define Ca(x) to be the length of a shortest program p which prints a string y such that d(x,y) ≤ a. We also study a conditional version of this measure Ca, b(x|y) where the task is, given a string y′ such that d(y,y′) ≤ b, print a string x′ such that d(x,x′) ≤ a.
Lance Fortnow +2 more
openaire +1 more source
Resource-Bounded Kolmogorov Complexity
1990There is a classical approach to the problem of classifying strings with respect to the difficulty of computing them; in some sense, we look for a definition of the amount of information coded by the string. Intuitively, a difficult string contains a high amount of compactly coded information, and one has to know all this information in order to write ...
José Luis Balcázar +2 more
openaire +1 more source
Kolmogorov Complexity and Computational Complexity
1992There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures the computational resources necessary to recognize ...
openaire +1 more source
Current treatment and recent progress in gastric cancer
Ca-A Cancer Journal for Clinicians, 2021Smita S Joshi, Brian D Badgwell
exaly
Clinical management of metastatic colorectal cancer in the era of precision medicine
Ca-A Cancer Journal for Clinicians, 2022, Davide Ciardiello, Giulia Martini
exaly
Oncologic emergencies and urgencies: A comprehensive review
Ca-A Cancer Journal for Clinicians, 2022Bonnie Gould Rothberg +2 more
exaly
Dynamical memristors for higher-complexity neuromorphic computing
Nature Reviews Materials, 2022Suhas Kumar +2 more
exaly
Structural and functional complexity of HSP90 in cellular homeostasis and disease
Nature Reviews Molecular Cell Biology, 2023Gabriela Chiosis +2 more
exaly

