- Full text PDF available (19)
- This year (1)
- Last 5 years (14)
- Last 10 years (19)
Journals and Conferences
We survey what is known about limitwise monotonic functions and sets and discuss their applications in effective algebra and computable model theory. Additionally, we characterize the computably enumerable degrees that are totally limitwise monotonic, show the support strictly increasing 0′-limitwise monotonic sets on Q do not capture the sets with… (More)
We examine the sequences A that are low for dimension, i.e., those for which the effective (Hausdorff) dimension relative to A is the same as the unrelativized effective dimension. Lowness for dimension is a weakening of lowness for randomness, a central notion in effective randomness. By considering analogues of characterizations of lowness for randomness,… (More)
The spinal cords of 28 scoliosis patients between the ages of 1 month and 17 years were examined with magnetic resonance (MR) imaging. Complete visualization was obtained in all cases. In 15 patients (53%) neuropathologic abnormalities demonstrated by MR imaging significantly affected their clinical course, including tethered cords (n = 7), syringomyelia (n… (More)
A technique for performing core biopsies of indeterminate masses of the extracranial head and neck is described. Four patients with suspicious masses of the extracranial head and neck underwent coaxial core biopsies through an 18-gauge Hawkins-Akins blunt tip needle. Three of the four patients had diagnostically adequate samples. There were no neurologic or… (More)
We prove that the set of all points of effective Hausdorff dimension 1 in Rn (n ≥ 2) is connected, and simultaneously that the complement of this set is not path-connected when n = 2.
We show that the index set complexity of the computably categorical structures is Π1-complete, demonstrating that computable categoricity has no simple syntactic characterization. As a consequence of our proof, we exhibit, for every computable ordinal α, a computable structure that is computably categorical but not relatively ∆α-categorical.
We study completely decomposable torsion-free abelian groups of the form GS := ⊕n∈SQpn for sets S ⊆ ω. We show that GS has a decidable copy if and only if S is Σ2 and has a computable copy if and only if S is Σ 0 3.
The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function ψ such that for every partial recursive function φ and almost every x in the domain of φ there is a y in the domain of ψ with y ≤ x and ψ(y) > φ(x). While there is a full Π 1… (More)
Intraocular pressure (IOP) was measured in humans by Goldmann tonometry. Pressures were compared with either benoxinate or proparacaine as the anesthetic. It was found that the values obtained did not differ depending upon the choice of anesthetic.
We show the existence of noncomputable oracles which are low for Demuth randomness, answering a question in  (also Problem 5.5.19 in ). We fully characterize lowness for Demuth randomness using an appropriate notion of traceability. Central to this characterization is a partial relativization of Demuth randomness, which may be more natural than the… (More)