Severe epileptics may require curative neurosurgery. Sometimes focus localization requires recording with electrodes inserted deep into the brain, which may cause death or permanent neurological damage. Since epileptic seizures are associated with marked changes in cerebral impedance, we propose that EIT with sub-dural electrodes (inserted between the brain… (More)
Physical activity (PA) and cardiorespiratory fitness (CRF) are associated with better cognitive function in late life, but the neural correlates for these relationships are unclear. To study these correlates, we examined the association of both PA and CRF with measures of white matter (WM) integrity in 88 healthy low-fit adults (age 60-78). Using… (More)
Influenza A virus NS1 protein is a multifunctional virulence factor consisting of an RNA binding domain (RBD), a short linker, an effector domain (ED), and a C-terminal 'tail'. Although poorly understood, NS1 multimerization may autoregulate its actions. While RBD dimerization seems functionally conserved, two possible apo ED dimers have been proposed… (More)
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e. restricted to the computably enumerable degrees)… (More)
We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative random-ness, alternative to the Solovay reducibility. It also occurs naturally in proofs in classical computability theory as well as in the recent work of Soare, Nabutovsky and Weinberger on applications of computability to differential… (More)
Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results in this area—the theorem of Yu and Ding that there exists no cl-complete c.e. real—we go on to consider the global theory. The existential theory of the cl degrees is decidable but this… (More)
We study the Medvedev degrees of mass problems with distinguished topo-logical properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by… (More)
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random real satisfies this quasi-maximality property. As a corollary we may conclude that there exists no-complete ∆2 real. Upon realizing that quasi-maximality does not characterize the random… (More)
We prove a number of results in effective randomness, using methods in which Π 0 1 classes play an essential role. Amongst many others, the results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.