Related papers: A DNC function that computes no effectively bi-imm…
A recently introduced measure of Boolean functions complexity--disjunc\-tive complexity (DC)--is compared with other complexity measures: the space complexity of streaming algorithms and the complexity of nondeterministic branching programs…
The theory of testing statistical functionals is developed for non-parametric two-sample problems. For differentiable real-valued statistical functionals, some tests for the one-sided and two-sided cases are proposed and studied. The…
We axiomatically define a cardinal social inefficiency function, which, given a set of alternatives and individuals' vNM preferences over the alternatives, assigns a unique number -- the social inefficiency -- to each alternative. These…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…
In Boolean algebra, it is known that the logical function that corresponds to the negation of the conjunction --NAND-- is universal in the sense that any other logical function can be built based on it. This property makes it essential to…
We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…
Deep learning models are often not easily adaptable to new tasks and require task-specific adjustments. The differentiable neural computer (DNC), a memory-augmented neural network, is designed as a general problem solver which can be used…
Non-injective functions are not globally invertible. However, they can often be restricted to locally injective subdomains where the inversion is well-defined. In many settings a preferred solution can be selected even when multiple valid…
A skeleton of the category with finite coproducts D freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products C freely generated by a countable set of objects. As a consequence, we…
In this correspondence, an equivalent definition of algebraic immunity of Boolean functions is posed, which can clear up the confusion caused by the proof of optimal algebraic immunity of the Carlet-Feng function and some other functions…
This paper introduces and analyzes symmetric and anti-symmetric quantum binary functions. Generally, such functions uniquely convert a given computational basis state into a different basis state, but with either a plus or a minus sign.…
In this article, using generalized derivations, we obtain a simple idea to prove the non-commutative Newton binomial formula in unital algebras and then, we extend that formula to non-unital algebras. Additionally, we establish the…
In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…
We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable…
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…
Recent work in computability theory has focused on various notions of asymptotic computability, which capture the idea of a set being "almost computable." One potentially upsetting result is that all four notions of asymptotic computability…