13 papers · ranked by Valyu relevance
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…
Bruno Fava, Paulo C. Marques F., Hedibert F. Lopes, Carlos Alberto De Bragança Pereira + 2 more
'Carlos Alberto De Bragança Pereira' 'Paulo Canas Rodrigues' 'Mark Andrew Gannon'] Analysis of the currently established Bayesian nearest neighbors classification model points to a connection between the computation of its normalizing constant and issues of NP-completeness. An alternative predictive model constructed…
Tao Hong, William R. Stauffer
Economic deliberations are slow, effortful and intentional searches for solutions to difficult economic problems. Although such deliberations are critical for making sound decisions, the underlying reasoning strategies and neurobiological substrates remain poorly understood. Here two nonhuman primates performed a…
Juan Pablo Franco, Peter Bossaerts, Carsten Murawski, Daniele Marinazzo
Many everyday tasks require people to solve computationally complex problems. However, little is known about the effects of computational hardness on the neural processes associated with solving such problems. Here, we draw on computational complexity theory to address this issue. We performed an experiment in which…
Christopher P. Kempes, Michael Lachmann, Andrew Iannaccone, G. Matthew Fricke + 3 more
'G. Matthew Fricke' 'M. Redwan Chowdhury' 'Sara I. Walker' 'Leroy Cronin'] Assembly theory (AT) quantifies selection using the assembly equation, identifying complex objects through the assembly index, the minimal steps required to build an object from basic parts, and copy number, the observed instances of the object.…
Daniel G. Brown, Tiasa Mondol, Colin Johnson, Juan Romero + 1 more
We discuss how to assess computationally the aesthetic value of “small” objects, namely those that have short digital descriptions. Such small objects still matter: they include headlines, poems, song lyrics, short musical scripts and other culturally crucial items. Yet, small objects are a confounding case for our…
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…
Amirmohammad Farzaneh, Justin P. Coon, Mihai-Alin Badiu, Narsis A. Kiani + 2 more
'Narsis A. Kiani' 'Hector Zenil' 'Jesper Tegnér'] Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to calculate an upper…
Jonas Jäger, Roman V. Krems
Machine learning is considered to be one of the most promising applications of quantum computing. Therefore, the search for quantum advantage of the quantum analogues of machine learning models is a key research goal. Here, we show that variational quantum classifiers and support vector machines with quantum kernels…
Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernandez-Quiroz, Boris Ryabko
'Boris Ryabko'] We study practical approximations of Kolmogorov prefix complexity (K) using IMP2, a high-level programming language. Our focus is on investigating the optimality of the interpreter for this language as the reference machine for the Coding Theorem Method (CTM). This method is designed to address…
Davide Rattacaso, Daniel Jaschke, Marco Ballarin, Ilaria Siloi + 1 more
As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential remains limited by the exponential growth of equivalent expressions with increasing problem size. We introduce quantum normal form reduction…
Felipe S. Abrahão, Hector Zenil
One of the challenges of defining emergence is that one observer’s prior knowledge may cause a phenomenon to present itself as emergent that to another observer appears reducible. By formalizing the act of observing as mutual perturbations between dynamical systems, we demonstrate that the emergence of algorithmic…
Marius Krumm, Markus P. Müller, Michael Cuffaro, Stephan Hartmann
Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of “computational irreducibility” sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents…