Changes

His research interests in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] include [https://en.wikipedia.org/wiki/Formal_language formal models] of [https://en.wikipedia.org/wiki/Natural_computing natural computation], [https://en.wikipedia.org/wiki/Infinitary_logic infinitary languages], logic and [https://en.wikipedia.org/wiki/Automata_theory automata], [https://en.wikipedia.org/wiki/Singulation#Tree_walking tree-walking] automata, and [https://en.wikipedia.org/wiki/Pattern_matching patterns in strings] <ref>[http://wwwliacs.liacsleidenuniv.nl/organization~hoogeboomhj/people/showdetails?ID=39 People - LIACS H.J. Hoogeboom - Leiden Institute of Advanced Computer Science: Hendrik Jan Hoogeboomhomepage]</ref>. Along with [[Walter Kosters]] et al., Hendrik Hoogeboom works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[httphttps://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf) slides based on [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''20032002'''). ''Tetris is Hard, Even to Approximate''. [httphttps://wwwarxiv.informatik.uni-trier.deorg/~leyabs/dbcs/conf0210020 arXiv:cs/cocoon/cocoon2003.html COCOON 20030210020]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[https://liacs.leidenuniv.nl/~kosterswa/tetris/ How to Construct Tetris Configurations]</ref>.