Computability results for the iterative value function
Monotone iterative technique of Lakshmikantham for the initial value problem for a differential equation with a step function
... EQUATION WITH A STEP FUNCTION S. G. HRISTOVA and M. A. RANGELOVA Received 28 January 2001 and in revised form 18 June 2001 The initial value problem for a special kind of differential equations with a step ...
8
Recent results on iterative roots
... an iterative root is small, one can enlarge it a little bit by admitting functions with some ...A function with a unique jump can be identied with a multifunction with a unique set-valued point, where the ...
16
Iterative Estimation of the Extreme Value Index
... distribution function F having finite and unknown upper endpoint. A new iterative estimation procedure for the extreme value index is proposed and one implemented iterative estimator is ...
10
Iteration and Iterative Roots of Fractional Polynomial Function
... bc k 1−k n /1−k −1/x 1/c k n . 3.8 This completes the proof. In Theorems 2.1 and 2.2, we get the expression of f n of the fractional polynomial function 1.4 under different conditions, they can be treated as a ...
11
A generalized method for iterative error mining in parsing results
... • laat ons hopen dat het/dit lukt [let us hope that it/this works] 6.3 Scoring methods The miners that use n-gram expansion perform best with the M f = S f |O f | function, while the other miners perform best with ...
9
Real Number Computability and Domain Theory
... Here is a simple example that illustrates the inadequacy of the standard decimal representation. We show that no algorithm can compute multiplication by 3. A hypothetical algorithm for this function will not be ...
27
Rethinking Resource Allocation: Fairness and Computability
... 5.5 A Comparison with Goods Maximin share approximations for chores are typically much easier to compute than their counterpart for goods. Perhaps the most important difference between goods and chores comes from the ...
66
Testing computability by width-two OBDDs
... some results can be viewed as belonging to both ...other function classes, studied in [ 7 ...the function may depend (significantly) on many ...
16
The Nonlinear HSS-like Iterative Method for Absolute Value Equations
... HSS-like iterative method in [ 23 ] ...absolute value function | x | is ...HSS-like iterative method for solving weakly nonlinear linear systems is unsuitable for solving AVE, and need further ...
5
Low-dose CT of the lung: potential value of iterative reconstructions
... study results indicate that sinogram- affirmed iterative reconstruction reduces noise, improves image quality, and renders more low-dose CT studies of the lung diagnostic as compared to the conventional ...
10
The concept of computability
... if arithmetic is consistent, arithmetical truth goes beyond what can be proven in any (recursively axiomatisable) formal system. This means that formalism cannot provide us with a satisfactory account of the nature of ...
17
Randomness and Computability
... A natural question to ask when studying randomness is when is one in- finite binary sequence more random than another. One possible way of or- dering sequences according to randomness is given by the computable Lips- ...
218
Computability Theory
... Other references: “Introduction to the theory of computation” by Michael Sipser, and “Com- putability, Complexity, and Languages” by M. Davis and E. Weyuker. Our first goal is to give a formal definition for what it ...
12
Computability Theory
... Notice that it does not change our thesis to allow in our computations non- deterministic steps, wherein we are allowed free choice between a list of com- putational actions. For instance, any function computable ...
16
Computability and Tiling Problems
... computable function J that will com- plete our reduction, and is essentially a computable inverse of the operation of I, taking a coded sequence corresponding to edge-matched finite patches of S-tilings and ...
179
Monte Carlo Computability
... from results in the given references, except for the case of sorting, which we will precisely define and discuss in Section ...Carlo computability in Section ...
14
Computability in Symbolic Dynamics
... Abstract. We give an overview of the interplay between computability and symbolic dynamics. A multidimensional shift of finite type (SFT) is a set of colorings of Z d given by local rules. SFTs are one of the most ...
9
Iterative methods for a singular boundary-value problem
... However, we shall try to prove that these iterative methods may be used to approximate the solution of the considered problem, if we start with a convenient initial approximation... In o[r] ...
14
Optimising resilience : at the edge of computability
... expected value (ME), whereas margin is the difference between the maximum possible value (MP) and maximum expected value of the design ...possible value is not available from external ...
7
Layerwise Computability and Image Randomness
... semicomputable function t(·) with non-negative values defined on the Cantor space such that the integral of t with respect to any distribution in L does not exceed ...
25