In Spring 2010, when some students expressed confusion over the JAPE assignment, RobertKeller put together an example problem and solution in 18 slides detailing how to do every click and what every part of the proof was. In about 30 minutes. At 3 am. |

RobertKeller has two states: Solve and Halt.

There is no such thing as the halting problem, only a list of algorithms RobertKeller allows to complete.

RobertKeller has three moods. Regular, CONTEXT-FREE, and **RECURSIVE**.

RobertKeller built a Halt Checker. Twice.

- The first was written in a prolog/rex hybrid. The second was a DFA.

RobertKeller appeared in the "Street Fighter II" video game, but was removed by Beta Testers because every button caused him to make a TuringMachine. When asked bout this "glitch," Keller replied, "That's no glitch."

RobertKeller does not sleep. He halts.

*Does RobertKeller know about this page yet?*- If not, it's just because he hasn't made a TuringMachine to determine if it exists yet.