Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, April 02, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Nemanja Skoric

Hennie and Stearns gave a construction of universal Turing machine (abbr. UTM) that can simulate any Turing machine with only logarithmic overhead. This result has not been improved for over 45 years, while, on the other hand, no superlinear lower bound is known. Since a TM tape can be simulated by two stacks, any stack implementation in TM model that allows executing n commands in t(n) time for any constant number of stacks implies UTM working in time O(t(n)). The main contribution of H&S can be viewed as such smart stack implementation in time O(n log n).

In this thesis we explore the time complexity of stack implementations on Turing machines. Two kinds of restrictions on implementations were investigated, both of which are satisfied by the implementation in UTM of H & S. We prove a lower bound of Omega(n log n) for both, implying that stack implementation of H & S is optimal under these restrictions.

Furthermore, we consider a natural probability distribution of command sequences and describe a stack implementation that can execute almost all of its sequences in time O(n log log n). This implies that showing a lower bound of Omega(n log n) (if possible at all) would require a more involved strategy than choosing a random sequence from our distribution.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login