Nicholas J. Hay
I'm a fourth year PhD student of Prof. Stuart
Russell, working on metareasoning: the problem of designing
systems which reason about their reasoning, or more generally spend
time computing what they should next compute. We are looking to
develop a firm theoretical foundation, then build practical applications upon it.
I was a GSI for the Spring 2009 undergraduate AI course CS188.
- Nicholas Hay, Stuart Russell, Solomon Eyal Shimony, and David Tolpin,
``Selecting Computations: Theory and Applications.''
In Proc. UAI-12, Catalina Island, 2012.
- Nicholas J. Hay and Stuart Russell,
``Metareasoning for Monte Carlo Tree Search.''
Technical Report No. UCB/EECS-2011-119, EECS Department, University of California, Berkeley, 2011.
- Cristian S. Calude, Nicholas J. Hay,
computably enumerable random real is provably computably enumerable
In Logic Journal of the IGPL, June, 2009.
- Nicholas J. Hay ``Simulation
Complexity,'' In Fundamenta Informaticae 83(1-2): 117-140, 2008.
- Nicholas J. Hay ``Universal
Semimeasures: An Introduction.'' Masters Thesis,
University of Auckland Computer Science Department, 2007. Also
appeared as CDMTCS Technical Report 300, 2007.
- Shayne Waldron and Nick Hay. ``On
computing all harmonic frames of $n$ vectors in $\C^d$,''
In Applied and Computational Harmonic Analysis, 21(2):1-1-181, 2006.
- Nicholas J Hay. ``Optimal
Agents.'' Honours thesis, University of Auckland Computer Science
Department, 2005. Also available as
Technical Report 275, 2005.