If you are interested in joining our quantum computing reading group, contact me. We meet twice a week and are reading Classical and Quantum Computation by Kitaev et al.

Q: How many unwinnable games of solitaire are there? It's easy to computationally enumerate arrangements with no opening moves. How do we deal with ones with opening moves, but no possible winning sequence?

To see my recent reading list, view my website here.

A proposed network level solution to some IoT security problems (work done in EECS 582): IoT Minder

Comic relief.

If you know of something that might help or interest me--reading, a youtube video, an answer to a question--let me know; ditto if you think I can help you with something.