منابع مشابه
On tiered small jump operators
Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering. Here, we refine predicative analysis by using a ramified Ackermann’s construction of a non-primitive recursive function. We obtain a hierarchy of functions wh...
متن کاملComposition Operators on Small Spaces
We show that if a small holomorphic Sobolev space on the unit disk is not just small but very small, then a trivial necessary condition is also sufficient for a composition operator to be bounded. A similar result for holomorphic Lipschitz spaces is also obtained. These results may be viewed as boundedness analogues of Shapiro’s theorem concerning compact composition operators on small spaces. ...
متن کاملJUMP-Means: Small-Variance Asymptotics for Markov Jump Processes
Markov jump processes (MJPs) are used to model a wide range of phenomena from disease progression to RNA path folding. However, maximum likelihood estimation of parametric models leads to degenerate trajectories and inferential performance is poor in nonparametric models. We take a small-variance asymptotics (SVA) approach to overcome these limitations. We derive the small-variance asymptotics ...
متن کاملA Small Course on Indistinguishability Operators
This is a short introduction to indistinguishability operators. Section 1 contains the definition of these operators and gives basic reasons for their study. Section 2 explains the two most popular ways to generate them, depending on the way the data are given. Section 3 introduces the idea of extensionality and shows that extensional fuzzy subsets with respect to a T -indistinguishability oper...
متن کاملPseudo Jump Operators . I : the R . E . Case
Call an operator / on the power set of w a pseudo jump operator if J(A) is uniformly recursively enumerable in A and A is recursive in J(A) for all subsets A of u. Thus the (Turing) jump operator is a pseudo jump operator, and any existence proof in the theory of re. degrees yields, when relativized, one or more pseudo jump operators. Extending well-known results about the jump, we show that fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(1:7)2009