نتایج جستجو برای: reducibility

تعداد نتایج: 2020  

Journal: :the archives of bone and joint surgery 0
lauren k ehrlichman naval hospital beaufort, beaufort, sc tyler a gonzalez resident physician, harvard combined orthopaedic surgery program, department of orthopaedic surgery, massachusetts general hospital alec a. macaulay foot & ankle surgery fellow, harvard medical school, department of orthopaedic surgery, brigham hospital mohammad ghorbanhoseini orthopedic surgeon, research scholar, harvard medical school, bidmc, carl j. shapiro department of orthopaedics 330 brookline avenue boston ma 02215 john y kwon assistant professor, harvard medical school, bidmc, carl j. shapiro department of orthopaedics

background: while various radiographic parameters and application of manual/gravity stress have been proposed to elucidate instability for weber b fibula fractures, the prognostic capability of these modalities remains unclear. determination of anatomic positioning of the mortise is paramount. we propose a novel view, the gravity reduction view (grv), which helps elucidate non-anatomic position...

2010
Ali Akbar Safilian Farzad Didehvar

In this article we define a new reducibility based on enumeration orders.

Journal: :J. Symb. Log. 1995
Rodney G. Downey Richard A. Shore

The primary relation studied in recursion theory is that of relative complexity: A set or function A (of natural numbers) is reducible to one B if, given access to information about B, we can compute A. The primary reducibility is that of Turing, A ≤ T B, where arbitrary (Turing) machines, ϕ e , can be used; access to information about (the oracle) B is unlimited and the lengths of computations...

Journal: :Annals of Pure and Applied Logic 1993

Journal: :Comptes Rendus Mathematique 2011

2015
JOSEPH S. MILLER

We prove that if I is a countable ideal in the Turing degrees, then the field RI of real numbers in I is computable from exactly the degrees that list the functions (i.e., elements of ωω) in I. This implies, for example, that the degree spectrum of the field of computable real numbers consists exactly of the high degrees. We also prove that if I is a countable Scott ideal, then it is strictly e...

2009
SU GAO

Recently, there has been a growing interest in understanding the complexity of common analytic equivalence relations between separable Banach spaces via the notion of Borel reducibility in descriptive set theory (see [Bos] [FG] [FLR] [FR1] [FR2] [Me]). In general, the notion of Borel reducibility yields a hierarchy (though not linear) among equivalence relations in terms of their relative compl...

Journal: :Math. Log. Q. 2005
Vasco Brattka

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire sp...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید