Related papers: Solomonoff Induction Violates Nicod's Criterion
(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…
Simonton (2006) makes the unwarranted assumption that nonmonotonicity supports a Darwinian view of creativity. Darwin's theory of natural selection was motivated by a paradox that has no equivalent in creative thought: the paradox of how…
Lately there has been a lot of discussion about why deep learning algorithms perform better than we would theoretically suspect. To get insight into this question, it helps to improve our understanding of how learning works. We explore the…
We prove that a knot is the unknot if and only if its reduced Khovanov cohomology has rank 1. The proof has two steps. We show first that there is a spectral sequence beginning with the reduced Khovanov cohomology and abutting to a knot…
Neural classifiers are non linear systems providing decisions on the classes of patterns, for a given problem they have learned. The output computed by a classifier for each pattern constitutes an approximation of the output of some unknown…
Slutsky symmetry and negative semidefiniteness are necessary and sufficient conditions for the rationality of demand functions. While the empirical implications of Slutsky negative semidefiniteness in repeated cross-sectional demand data…
Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep…
We observe $(X_i,Y_i)_{i=1}^n$ where the $Y_i$'s are real valued outputs and the $X_i$'s are $m\times T$ matrices. We observe a new entry $X$ and we want to predict the output $Y$ associated with it. We focus on the high-dimensional…
Modeling the dynamics of non-stationary stochastic systems requires balancing the representational power of deep learning with the mathematical transparency of classical models. While classical Markov transition operators provide explicit,…
A theorem of Ku\v{c}era states that given a Martin-L\"of random infinite binary sequence {\omega} and an effectively open set A of measure less than 1, some tail of {\omega} is not in A. We first prove several results in the same spirit and…
Correlated stability conjecture (CSC) proposed by Gubser and Mitra [1,2] linked the thermodynamic and classical (in)stabilities of black branes. In [3] it was shown that the thermodynamic instabilities, specifically the negative specific…
The Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST) will discover an unprecedented number of supernovae (SNe), making spectroscopic classification for all the events infeasible. LSST will thus rely on photometric…
Proof by induction plays a critical role in formal verification and mathematics at large. However, its automation remains as one of the long-standing challenges in Computer Science. To address this problem, we developed sem_ind. Given…
When does society eventually learn the truth, or take the correct action, via observational learning? In a general model of sequential learning over social networks, we identify a simple condition for learning dubbed excludability.…
We pursue the idea of generalizing Hindman's Theorem to uncountable cardinalities, by analogy with the way in which Ramsey's Theorem can be generalized to weakly compact cardinals. But unlike Ramsey's Theorem, the outcome of this paper is…
We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…
If no optimal propositional proof system exists, we (and independently Pudl\'ak) prove that ruling out length $t$ proofs of any unprovable sentence is hard. This mapping from unprovable to hard-to-prove sentences powerfully translates facts…
We consider a typical integration of induction in saturation-based theorem provers and investigate the effects of Skolem symbols occurring in the induction formulas. In a practically relevant setting we establish a Skolem-free…
Bailey showed that the general pointwise forecasting for stationary and ergodic time series has a negative solution. However, it is known that for Markov chains the problem can be solved. Morvai showed that there is a stopping time sequence…
We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red…