相关论文: Post's problem for supertasks has both positive an…

A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all…

This paper is a revision and an enlargement of the previous version titled "Extreme points of the unit ball of a quasi-multiplier space" which had been circulated since 2004. We study extreme points of the unit ball of an operator space by…

Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…

This paper analyzes the structure of the set of positive solutions of a class of one-dimensional superlinear indefinite bvp's. It is a paradigm of how mathematical analysis aids the numerical study of a problem, whereas simultaneously its…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…

Given a finite honest time, we first show that the associated Az\'ema optional supermartingale can be expressed as the drawdown and the relative drawdown of some local optional supermartingales with continuous running supremum. The relative…

This work establishes a rigorous theoretical foundation for analyzing deep learning systems by leveraging Infinite Time Turing Machines (ITTMs), which extend classical computation into transfinite ordinal steps. Using ITTMs, we reinterpret…

Existing models of computation, such as a Turing machine (hereafter, TM), do not consider the agent involved in interpreting the outcome of the computation. We argue that a TM, or any other computation model, has no significance if its…

The `ultra-discrete limit' has provided a link between integrable difference equations and cellular automata displaying soliton like solutions. In particular, this procedure generally turns strictly positive solutions of algebraic…

Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating…

We observe that successive applications of known results from the theory of positive systems lead to an {\it efficient general algorithm} for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one…

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

Many Engineering Problems could be mathematically described by Final Value Problem, which is the inverse problem of Initial Value Problem. Accordingly, the paper studies the final value problem in the field of ODE problems and analyses the…

This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

Continuously learning to solve unseen tasks with limited experience has been extensively pursued in meta-learning and continual learning, but with restricted assumptions such as accessible task distributions, independently and identically…

We study the periodic boundary value problem associated with the second order nonlinear equation \begin{equation*} u'' + ( \lambda a^{+}(t) - \mu a^{-}(t) ) g(u) = 0, \end{equation*} where $g(u)$ has superlinear growth at zero and sublinear…

In this paper, we introduce semi-infinite tensor complementarity problem to provide an approach for considering a more realistic situation of the problem. We prove the necessary and sufficient conditions for the existence of the solution…