26 papers · ranked by Valyu relevance
Mohamed Alaskandarani, Kamaludin Dingle
Developing new ways to estimate probabilities can be valuable for science, statistics, and engineering. By considering the information content of different output patterns, recent work invoking algorithmic information theory has shown that a priori probability predictions based on pattern complexities can be made in a…
Yaroslav Ivanashev
A language L is low for a relativizable complexity class C, if it doesn't increase the computational power of a class when it is used as an oracle: C L = C. For the classes #P, GapP, and SpanP low classes of languages are known: Low(#P) = UP∩coUP, Low(GapP) = SPP, and Low(SpanP) = NP∩coNP. In this paper, we prove that…
Danupon Nanongkai, Michele Scquizzato
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this…
Ajay Subbaroyan, Olivier C Martin, Areejit Samal, Karen E Nelson
The properties of random Boolean networks have been investigated extensively as models of regulation in biological systems. However, the Boolean functions (BFs) specifying the associated logical update rules should not be expected to be random. In this contribution, we focus on biologically meaningful types of BFs, and…
Martina Prugger, Lukas Einkemmer, Carlos F. Lopez
Solving the chemical master equation is an indispensable tool in understanding the behavior of biological and chemical systems. In particular, it is increasingly recognized that commonly used ODE models are not able to capture the stochastic nature of many cellular processes. Solving the chemical master equation…
Tonon, Luke
In this paper, we revisit the fundamentals of Circuit Complexity and the nature of efficient computation from a new perspective. We present a framework for understanding Circuit Complexity through the lens of Information Theory with analogies to results in Kolmogorov Complexity, viewing circuits as descriptions of…
Tiasa Mondol, Daniel G. Brown, Ercan Kuruoglu
We build an analysis based on the Algorithmic Information Theory of computational creativity and extend it to revisit computational aesthetics, thereby, improving on the existing efforts of its formulation. We discuss Kolmogorov complexity, models and randomness deficiency (which is a measure of how much a model falls…
Michał J. Wójcik, Amy Li, Dante Wasmuht, Jake P. Stroud + 3 more
Working memory has been traditionally studied as a passive storage for information. However, recent advances have suggested that working memory is prospective rather than retrospective, meaning that its content undergoes transformations that will support future behaviour. One perspective that underscores this notion…
Adrian Krzyzanowski, Axel Pahl, Michael Grigalunas, Herbert Waldmann
The fraction of sp3 hybridised carbons (Fsp3) and the fraction of stereogenic carbons (FCstereo) are two widely employed scores of molecular complexity with a strong link to biologically relevant features such as frequency, potency and selectivity of protein binding. However, due to their simplistic nature, they do not…
George Dimitriadis, Ella Svahn, Andrew MacAskill, Athena Akrami
To realise a research project idea, an experimenter faces a series of conflicting design and implementation considerations, regarding both its hardware and software components. For instance, the ease of implementation, in time and expertise, should be balanced against the ease of future reconfigurability and number of…
Samuel Planton, Fosca Al Roumi, Liping Wang, Stanislas Dehaene
According to the language of thought hypothesis, regular sequences are compressed in human working memory using recursive loops akin to a mental program that predicts future items. We tested this theory by probing working memory for 16-item sequences made of two sounds. We recorded brain activity with functional MRI…
Johnjoe McFadden
Occam's razor-the principle of simplicity-has recently been attacked as a cultural bias without rational foundation. Increasingly, belief in pseudoscience and mysticism is growing. I argue that inclusion of Occam's razor is an essential factor that distinguishes science from superstition and pseudoscience. I also…
Matthew Witman, Norman Bartelt, Sanliang Ling, Pinwen Guan + 3 more
Efficient prediction of sampling-intensive thermodynamic properties in both closed and open systems is needed to evaluate material performance and permit high-throughput materials discovery for a diverse array of technology applications, from rational design of low-density high entropy alloys, to optimizing battery…
Tristan Stérin, Abeer Eshra, Janet Adio, Constantine Glen Evans + 1 more
Like life, computers are out-of-equilibrium.^1,2^ Thermodynamically favoured error states are thwarted by energetically-costly processes such as kinetic proofreading of biological polymers, error-correcting codes in computer data storage, and redundancy in molecular programming. Decades of theoretical work shows that…
Neil Immerman
I was a student of Juris Hartmanis at Cornell in the late 1970's. He believed that there was great potential in studying restricted reductions. I describe here some of his influences on me and, in particular, how his insights concerning reductions helped me to prove that nondeterministic space is closed under…
Patrizia Schalk, Artem Polyvyanyy
Simple process models are key for effectively communicating the outcomes of process mining. An important question in this context is whether the complexity of event logs used as inputs to process discovery algorithms can serve as a reliable indicator of the complexity of the resulting process models. Although various…
Matthijs Ruijgrok
A measure for the complexity of a differentiable function f(x) on an interval is introduced. It is based on approximations of the function by piecewise constant functions. The measure takes into account the quality of the approximation and the number of intervals in the approximating function. This measure, called the…
Ruben Sanchez-Garcia, Dávid Havasi, Gergely Takács, Matthew C. Robinson + 3 more
Compound availability is a critical property for design prioritization across the drug discovery pipeline. Historically, and despite their multiple limitations, compound-oriented synthetic accessibility scores have been used as proxies for this problem. However, the size of the catalogues of commercially available…
Authors not listed
Mass spectrometry (MS) generates large datasets that are stored in increasingly optimized and complex file types, demanding technical expertise to extract information rapidly and easily. We wondered whether a simple structured query language (SQL) database could hold raw MS data and allow for easily readable queries…
Ruben Sanchez-Garcia, Dávid Havasi, Gergely Takács, Matthew C. Robinson + 3 more
Compound availability is a critical property for design prioritization across the drug discovery pipeline. Historically, and despite their multiple limitations, compound-oriented synthetic accessibility scores have been used as proxies for this problem. However, the size of the catalogues of commercially available…
Ruben Sanchez-Garcia, Dávid Havasi, Gergely Takács, Matthew C. Robinson + 3 more
Compound availability is a critical property for design prioritization across the drug discovery pipeline. Historically, and despite their multiple limitations, compound-oriented synthetic accessibility scores have been used as proxies for this problem. However, the size of the catalogues of commercially available…
Tianqi Wu, Haisha Zhang, Kun Wu
Diverse interpretations of the fundamental nature of the world and its evolutionary patterns have shaped multiple paradigms of scientific and philosophical thinking. At the micro level, ontological understandings have evolved from the ancient Greek atomic theory to modern conceptions based on dynamic energy fields. At…
Ruben Sanchez-Garcia, Dávid Havasi, Gergely Takács, Matthew C. Robinson + 3 more
Compound availability is a critical property for design prioritization across the drug discovery pipeline. Historically, and despite their multiple limitations, compound-oriented synthetic accessibility scores have been used as proxies for this problem. However, the size of the catalogues of commercially available…
Alex J.H. Fedorec, Neythen J. Treloar, Ke Yan Wen, Linda Dekker + 7 more
Building computationally capable biological systems has long been an aim of synthetic biology. The potential utility of biocomputing devices ranges from biosafety and environmental applications to diagnosis and personalised medicine. Here we present work for the design of bacterial computers which use spatial…
David A. Juckett, Pasquale Stano, James R. Lyons
The origin of life embodies two fundamental questions: how and when did life begin? It is commonly conjectured that life began on Earth around 4 billion years ago. This requires that the complex organization of RNA, DNA, triplet codon, protein, and lipid membrane (RDTPM) architecture was easy to establish between the…
Alexander L. Ling, Weijie Zhang, Adam Lee, Yunong Xia + 7 more
High-throughput drug screens are a powerful tool for cancer drug development. However, the results of such screens are often made available only as raw data, which is intractable for researchers without informatic skills, or as highly processed summary statistics, which can lack essential information for translating…