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

The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes (TOP-ST-MIN) is a variant of the classic Team Orienteering Problem (TOP), which includes three novel features that stem from two real-world problems…

The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…

Transfer learning is a machine learning paradigm where the knowledge from one task is utilized to resolve the problem in a related task. On the one hand, it is conceivable that knowledge from one task could be useful for solving a related…

We study the periodic and the Neumann boundary value problems associated with the second order nonlinear differential equation \begin{equation*} u'' + c u' + \lambda a(t) g(u) = 0, \end{equation*} where $g \colon…

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

The Jump Inversion Theorem says that for every real $A \ge_T 0'$ there is a real $B$ such that $A \equiv_T B' \equiv_T B \oplus 0'$. A known refinement of this theorem says that we can choose $B$ to be a member of any special $\Pi^0_1$…

A concept of randomness for infinite time register machines (ITRMs) is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of…

A boundary value problem on an unbounded domain, associated to difference equations with the Euclidean mean curvature operator is considered. The existence of solutions which are positive on the whole domain and decaying at infinity is…

We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We…

In this thesis, we will look at some known and some previously uninvestigated notions of effective undecidability. We try to discover how far we can stretch effective undecidability in the hope to get a more tractable solution to Post's…

In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…

In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thus, positive Turing and Turing reducibility to NP differ sharply…

We propose statistical tests to discriminate between the finite and infinite activity of jumps in a semimartingale discretely observed at high frequency. The two statistics allow for a symmetric treatment of the problem: we can either take…

We consider the class of non-Hermitian operators represented by infinite tridiagonal matrices, selfadjoint in an indefinite inner product space with one negative square. We approximate them with their finite truncations. Both infinite and…

New status in quantum mechanics is connected with recent achievements in the inverse problem. With its help instead of about ten exactly solvable models which serve as a basis of the contemporary education there are infinite (!) number,…

Implicit methods for the numerical solution of initial-value problems may admit multiple solutions at any given time step. Accordingly, their nonlinear solvers may converge to any of these solutions. Below a critical timestep, exactly one…

I argue that we must distinguish between: (0) the Three-Doors-Problem Problem [sic], which is to make sense of some real world question of a real person. (1) a large number of solutions to this meta-problem, i.e., many specific…

We consider an optimal stopping time problem related with many models found in real options problems. The main goal of this work is to bring for the field of real options, different and more realistic pay-off functions, and negative…

Voltage peaks on a conventional computer's power lines allow for the well-known dangerous DPA attacks. We show that measurement of a quantum computer's transient state during a computational step reveals information about a complete…

This paper presents a novel numerical optimisation method for infinite dimensional optimisation. The functional optimisation makes minimal assumptions about the functional and without any specific knowledge on the derivative of the…