#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1990

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We introduce Oberwolfach randomness, a notion within Demuth’s framework of statistical tests with moving components; here the components’ movement has to be coherent across levels. We show that a ML-random set computes all K-trivial sets if and only if it is not Oberwolfach random, and indeed that there is a K-trivial set which is not computable from any… (More)

- D B Turetsky, F S Vines, D A Clayman, H M Northup
- Annals of emergency medicine
- 1993

STUDY OBJECTIVE
To determine whether the addition of the supine oblique view of the cervical spine can detect fractures or ligamentous injury not seen on the standard three-view examination.
DESIGN
Radiographs of patients with documented cervical spine injury were reviewed retrospectively by three neuroradiologists. Patients were included in the study if… (More)

- T A Goedde, E R Frykberg, J M Crump, S F Lay, D B Turetsky, S S Linden
- The American surgeon
- 1992

To determine the efficacy of mammography in the detection of early breast carcinoma at an urban teaching hospital, the results of all breast biopsies performed between 1983 and 1987 that were preceded by mammographic examination were retrospectively reviewed. There were 503 women in this population. Malignancy was detected in 79 cases (15.7%); 21 were in… (More)

We show that a ∆2 Turing degree computes solutions to all computable instances of the finite intersection principle if and only if it computes a 1-generic degree. We also investigate finite and infinite variants of the prin-

Fix c : [N] → r, an r-coloring of the pairs of natural numbers. An ordered list of distinct integers, a0, a1, a2 . . . ai−1, ai, ai+1 . . . is a monochromatic path for color k, if, for all i ≥ 1, c({ai−1, ai}) = k. The empty list is considered a path of any color k. Similarly the list of one element, a0, is also considered a path of any color k. For any… (More)

- DAN TURETSKY
- 2017

Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e. set of the same ML-degree. We investigate the interplay between ML-reducibility and cost functions, which are used to both measure the number of changes in a computable approximation,… (More)

- G L McLellan, D B Turetsky, D A Swartz
- Urology
- 1991

- D B Turetsky, F S Vines, D A Clayman
- AJNR. American journal of neuroradiology
- 1990

A 56-year-old white male physician presented with a 5-year history of recurrent and intermittent hearing loss. The symptoms were predominantly right-sided and were increasing in frequency. Hearing loss was interfering with his ability to perform auscultatory examinations. He was able to temporarily restore hearing with the frequent use of carbamide peroxide… (More)

- D B Turetsky, L H Wilf
- Clinical nuclear medicine
- 1990

- D B Turetsky, A A Alexander, S S Linden
- Journal of clinical ultrasound : JCU
- 1991

- ‹
- 1
- ›