Related papers: A note on Automatic Baire property
A set X which is a subset of the Cantor set has property (s) (Marczewski (Spzilrajn)) iff for every perfect set P there exists a perfect set Q contained in P such that Q is a subset of X or Q is disjoint from X. Suppose U is a nonprincipal…
We introduce a diagrammatic braided monoidal category, the quantum spin Brauer category, together with a full functor to the category of finite-dimensional, type $1$ modules for $U_q(\mathfrak{so}(N))$ or $U_q(\mathfrak{o}(N))$. This…
We identify a strong structural obstruction to Uniform Separation in constructive arithmetic. The mechanism is independent of semantic content; it emerges whenever two distinct evaluator predicates are sustained in parallel and inference…
The Machine Consciousness Hypothesis states that consciousness is a substrate-free functional property of computational systems capable of second-order perception. I propose a research program to investigate this idea in silico by studying…
We introduce APPL (Abstract Program Property Logic), a unifying Hoare-style logic that subsumes standard Hoare logic, incorrectness logic, and several variants of Hyper Hoare logic. APPL provides a principled foundation for abstract program…
We introduce the point degree spectrum of a represented space as a substructure of the Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees, continuous degrees, and so on. The notion of point degree spectrum…
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states.…
A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…
We prove the Moore and the Myhill property for strongly irreducible subshifts over right amenable and finitely right generated left homogeneous spaces with finite stabilisers. Both properties together mean that the global transition…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on the action and context. We consider this problem under a…
Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
Given a Banach space X and a subspace Y, the pair (X,Y) is said to have the approximation property (AP) provided there is a net of finite rank bounded linear operators on X all of which leave the subspace Y invariant such that the net…
Bayesian additive regression trees (BART) is a non-parametric method to approximate functions. It is a black-box method based on the sum of many trees where priors are used to regularize inference, mainly by restricting trees' learning…
Existing property (T) proofs for $Aut(F_n)$, $n\geq 4$, rely crucially on extensive computer calculations. We give a new proof that $Aut(F_n)$ has property (T) for all but finitely many $n$ that is inspired by the semidefinite programming…
We propose a concise function representation based on deterministic finite state automata for exact most probable explanation and constrained optimization tasks in graphical models. We then exploit our concise representation within Bucket…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…