#### Filter Results:

#### Publication Year

2012

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Robyn R. Lutz, Jack H. Lutz, +5 authors Eric R. Henderson
- RE
- 2012

—DNA nanotechnology uses the information processing capabilities of nucleic acids to design self-assembling, programmable structures and devices at the nanoscale. Devices developed to date have been programmed to implement logic circuits and neural networks, capture or release specific molecules, and traverse molecular tracks and mazes. Here we investigate… (More)

- Neil Lutz, Donald M. Stull
- TAMC
- 2017

We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax + b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower bound on the (classical) Hausdorff dimension of generalized sets of Furstenberg type.

- Neil Lutz, Donald M. Stull
- ArXiv
- 2017

This paper investigates the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual points on L. We draw on Kolmogorov complexity and geometrical arguments to show that if the effective Hausdorff… (More)

- Donald M. Stull
- ArXiv
- 2016

We prove a downward separation for Σ 2-time classes. Specifically, we prove that if Σ 2 E does not have polynomial size non-deterministic circuits, then Σ 2 SubEXP does not have fixed polynomial size non-deterministic circuits. To achieve this result, we use Santhanam's technique [16] on augmented Arthur-Merlin protocols defined by Ay-dinlio˘ glu and van… (More)

When p is a computable real so that p ≥ 1, the isometry degree of a computable copy B of ℓ p is defined to be the least powerful Turing degree that computes a linear isometry of ℓ p onto B. We show that this degree always exists and that when p = 2 these degrees are precisely the c.e. degrees.

- Xiang Huang, Donald M. Stull
- MFCS
- 2016

We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko's framework for polynomial space computability in R n to define weakly pspace-random points, a new variant of polynomial space randomness. We show that the Lebesgue differentiation theorem characterizes… (More)

- Xiang Huang, Donald M. Stull
- ArXiv
- 2015

We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko's framework for polynomial space computabil-ity in R n to define weakly pspace-random points, a new variant of polynomial space randomness. We show that the Lebesgue differentiation theorem holds for every… (More)

- Adam Case, Jack H. Lutz, Donald M. Stull
- Electronic Colloquium on Computational Complexity
- 2015

Chemical reaction networks (CRNs) model the behavior of molecules in a well-mixed solution. The emerging field of molecular programming uses CRNs not only as a descriptive tool, but as a programming language for chemical computation. Recently, Chen, Doty and Soloveichik introduced rate-independent continuous CRNs (CCRNs) to study the chemical computation of… (More)

- Divita Mathur, DIVITA MATHUR, +16 authors Christine A. Petersen
- 2013

Education 2010-I am interested in DNA Nanotechnology and Nanodevices. My ongoing projects address the design, contruction, applications and requirements engineering of DNA nanostructures, particularly DNA Origami. 2009 " Review on Transgenic Crops " , winter internship under Dr. K C Bansal, National Research Center for Plant Biotechnology (NRCPB), India.… (More)

- ‹
- 1
- ›