#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2005

2016

- This year (0)
- Last five years (7)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Santino D Carnevale, Thomas F Kent, +4 authors Roberto C Myers
- Nano letters
- 2013

Polarization-induced nanowire light emitting diodes (PINLEDs) are fabricated by grading the Al composition along the c-direction of AlGaN nanowires grown on Si substrates by plasma-assisted molecular beam epitaxy (PAMBE). Polarization-induced charge develops with a sign that depends on the direction of the Al composition gradient with respect to the [0001]… (More)

- MARIA L. AFFATATO, THOMAS F. KENT, ANDREA SORBI, Lachlan Nondiamond
- 2007

We give an alternative and more informative proof that every nontrivial Σ 0 2-enumeration degrees is the meet of two incomparable Σ 0 2-degrees, which allows us to show the stronger result that for every incomplete Σ 0 2-enumeration degree a, there exist enumeration degrees x 1 and x 2 such that a, x 1 , x 2 are incomparable, and for all b ≤ a, b = (b ∪ x… (More)

- Thomas F. Kent
- J. Symb. Log.
- 2010

- Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi
- Ann. Pure Appl. Logic
- 2012

- Santino D Carnevale, Thomas F Kent, Patrick J Phillips, Michael J Mills, Siddharth Rajan, Roberto C Myers
- Nano letters
- 2012

Almost all electronic devices utilize a pn junction formed by random doping of donor and acceptor impurity atoms. We developed a fundamentally new type of pn junction not formed by impurity-doping, but rather by grading the composition of a semiconductor nanowire resulting in alternating p and n conducting regions due to polarization charge. By linearly… (More)

- Thomas F. Kent
- 2005

Enumeration reducibility was introduced by Friedberg and Rogers in 1959 as a positive reducibility between sets. The enumeration degrees provide a wider context in which to view the Turing degrees by allowing us to use any set as an oracle instead of just total functions. However, in spite of the fact that there are several applications of enumeration… (More)

- Thomas F. Kent, Andrea Sorbi
- J. Symb. Log.
- 2007

- A T M Golam Sarwar, Santino D Carnevale, +4 authors Roberto C Myers
- Small
- 2015

Bottom-up nanowires are attractive for realizing semiconductor devices with extreme heterostructures because strain relaxation through the nanowire sidewalls allows the combination of highly lattice mismatched materials without creating dislocations. The resulting nanowires are used to fabricate light-emitting diodes (LEDs), lasers, solar cells, and… (More)

We show that the first order theory of the Σ 0 2 s-degrees is undecidable. Via isomorphism of the s-degrees with the Q-degrees, this also shows that the first order theory of the Π 0 2 Q-degrees is undecidable. Together with a result of Nies, the proof of the undecidability of the Σ 0 2 s-degrees yields a new proof of the known fact (due to Downey, LaForte… (More)

- Thomas F. Kent
- TAMC
- 2008

For any enumeration degree a let D s a be the set of s-degrees contained in a. We answer an open question of Watson by showing that if a is a nontrivial Σ 0 2-enumeration degree, then D s a has no least element. We also show that every countable partial order embeds into D s a .