We prove that the existential theory of the Turing degrees, in the language with Turing reduction, 0, and unary relations for the classes in the generalized high/low hierarchy, is decidable.

We introduce a vertex amplitude for 4d loop quantum gravity. We derive it from a conventional quantization of a Regge discretization of euclidean general relativity. This yields a spinfoam sum that corrects some difficulties of the Barrett-Crane theory. The second class simplicity constraints are imposed weakly, and not strongly as in Barrett-Crane theory. Thanks to a flip in the quantum algebr...

The sulfate kinetics in an anaerobic, sulfate-reducing biofilm were investigated with an annular biofilm reactor. Biofilm growth, sulfide production, and kinetic constants (K(m) and V(max)) for the bacterial sulfate uptake within the biofilm were determined. These parameters were used to model the biofilm kinetics, and the experimental results were in good agreement with the model predictions. ...

For this problem, however, the usual approach would be completely inadequate since approximating θ to any reasonable degree of accuracy would require n to be inordinately large. For example, on average we would have to set n ≈ 2.7014× 10 in order to obtain just one non-zero value of I. Clearly this is impractical and a much smaller value of n would have to be used. Using a much smaller value of...

The Perona–Malik (PM) model, a classical anisotropic diffusion, can preserve edges while removing the noise. However, the defect of traditional PM model is tending to contain the staircase effect in the processed image. For this reason, a novel ramp preserving Perona–Malik (RPPM) model based on a new edge indicator is presented. In the RPPM model, the diffusion coefficient of the PM model is ad...

In reinforcement learning (RL), stochastic environments can make learning a policy difficult due to high degrees of variance. As such, variance reduction methods have been investigated in other works, such as advantage estimation and controlvariates estimation. Here, we propose to learn a separate reward estimator to train the value function, to help reduce variance caused by a noisy reward sig...

The three quantifier theory of (R,≤T ), the recursively enumerable degrees under Turing reducibility, was proven undecidable by Lempp, Nies and Slaman [1998]. The two quantifier theory includes the lattice embedding problem and its decidability is a long standing open question. A negative solution to this problem seems out of reach of the standard methods of interpretation of theories because t...

In addition to the visual information contained in intensity and color, imaging polarimetry allows visual information to be extracted from the polarization of light. However, a major challenge of imaging polarimetry is image degradation due to noise. This paper investigates the mitigation of noise through denoising algorithms and compares existing denoising algorithms with a new method, based o...

On the Turing degree structure we consider an ordering relation, which is that inherited by the Turing reducibility on sets of natural numbers, and also the jump function, which arises naturally as the function on degrees induced by the operator which takes each set to its halting problem. In order to understand the structure it seems a basic task to understand the relationship between these tw...

We show the decidability of the existential theory of the recursively enumerable degrees in the language of Turing reducibility, Turing reducibility of the Turing jumps, and least and greatest element. The Existential Theory of the Poset of R.E. Degrees with a Predicate for Single Jump Reducibility