Related papers: P is not equal to NP intersect coNP for Infinite T…

A natural extension of the Hopf-cyclic cohomology, with coefficients, is introduced to encompass topological Hopf algebras. The topological theory allows to work with infinite dimensional Lie algebras. Furthermore, the category of…

This paper demonstrates that in classification problems, fully connected neural networks (FCNs) and residual neural networks (ResNets) cannot be approximated by kernel logistic regression based on the Neural Tangent Kernel (NTK) under…

The Curry-Howard correspondence is often called the proofs-as-programs result. I offer a generalization of this result, something which may be called machines as programs. Utilizing this insight, I introduce two new Turing Machines called…

We show that the computational power of the non-causal circuit model, i.e., the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity…

We present a scenario in $1 + 1$ and $3 + 1$ dimensional space time which is paradoxical in the presence of a time machine. We show that the paradox cannot be resolved and the scenario has {\em no} consistent classical solution. Since the…

Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.

The P versus NP problem is studied under the relational model of E. F. Codd. I found that the term "complete configuration" is unnecessary and harmful in computational complexity theory because of excessive symbol redundancy. For an input,…

We will focus on studying the ball measure of non-compactness $\alpha(T)$ for various particular instances of embedding operators in sequence spaces. Our first main goal is to find necessary and sufficient conditions for an identity…

In this paper, we interpret NDTM (NonDeterministic Turing Machine) used to define NP by tracing to the source of NP. Originally NP was defined as the class of problems solvable in polynomial time by a NDTM in the theorem of Cook, where the…

Let $L$ be a field of positive characteristic $p$ with a fixed algebraic closure $\overline{L}$, and let $\alpha_1,\alpha_2,\beta\in L$. For an integer $d\ge 2$, we consider the family of polynomials $f_{\lambda}(z) := z^d+\lambda$,…

We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $\Sigma_{2}$-admissible ordinals are never OTM-clockable and that…

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…

For a prime p and natural number n with p greater than or equal to n, we establish the existence of a non-functorial one-to-one correspondence between isomorphism classes of groups of order p^n whose derived subgroup has exponent dividing…

As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. Here we consider the natural problem of, given a circuit $C$,…

For several classical nonnegative integer functions, we investigate if they are members of the counting complexity class #P or not. We prove #P membership in surprising cases, and in other cases we prove non-membership, relying on standard…

In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…

Infinite time Turing machines (ITTMs) have been introduced by Hamkins and Lewis in their seminal article arXiv:math/9808093. The strength of the model comes from a limit rule which allows the ITTM to compute through ordinal stages. This…

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…

For $p,q\in\mathbb{N}$ and $\alpha,\beta\in\mathbb{R}$, we investigate the family of improper integrals \[\int_0^\infty\frac{(\cos\alpha x-\cos\beta x)^p}{x^q}dx.\] We establish a complete classification of the parameter ranges $(p, q;…