Above: My Halloween 2010 costume :) The transition table is the 6-state busy beaver, which encodes a Turing Machine that halts in 7x10^37000 steps. There is no 6-state Turing machine on binary alphabet that takes longer to halt! The 7-state busy beaver is currently unknown.

Hello, and welcome!

My name is Andrej Karpathy. I completed my undergraduate degree at the University of Toronto with a double major in Computer Science and Physics (and a minor in Mathematics, if that counts). I am working on my Master's degree at the University of British Columbia, studying Machine Learning, Motor Control, and Vision.

My current goals are to complete my Master's degree, go on to earn a PhD, and then stay in academia, teach, and conduct research with some of the brightest people in the world. Wish me luck :)

Hobbies include mostly creative activities such as Photography, Web Design, Programming, Drawing, and then other weird activities, such as quickly solving Rubik's cubes (I solve them in roughly 16 seconds). From sports I enjoy ping-pong, ice skating, and scuba diving.

I can be reached through email at andrej.karpathy at gmail.com

You can also find me on a huge variety of social networks-- I enjoy staying up to date with world news and my friends.