pith. sign in

Turlough Neary

Identifiers

  • name variant Turlough Neary 0.60 · backfill

Papers (9)

  1. A Cellular Automaton for Blocking Queen Games math.CO · 2015 · author #3
  2. Undecidability in binary tag systems and the Post correspondence problem for four pairs of words cs.FL · 2013 · author #1
  3. Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy cs.CC · 2013 · author #1
  4. The complexity of small universal Turing machines: a survey cs.CC · 2011 · author #1
  5. A boundary between universality and non-universality in spiking neural P systems cs.CC · 2009 · author #1
  6. On the computational complexity of spiking neural P systems cs.CC · 2009 · author #1
  7. Proceedings International Workshop on The Complexity of Simple Programs cs.CC · 2009 · author #1
  8. Small weakly universal Turing machines cs.CC · 2007 · author #1
  9. On the time complexity of 2-tag systems and small universal Turing machines cs.CC · 2006 · author #2

Mentions

  • 1506.01431 #3 · backfill · confidence 0.70 Turlough Neary
  • 1312.6700 #1 · backfill · confidence 0.70 Turlough Neary
  • 1304.0053 #1 · backfill · confidence 0.70 Turlough Neary
  • 1110.2230 #1 · backfill · confidence 0.70 Turlough Neary
  • 0912.0928 #1 · backfill · confidence 0.70 Turlough Neary
  • 0912.0741 #1 · backfill · confidence 0.70 Turlough Neary
  • 0906.4612 #1 · backfill · confidence 0.70 Turlough Neary
  • 0707.4489 #1 · backfill · confidence 0.70 Turlough Neary

Frequent Coauthors