Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer Shor, 1996 We’re sticking with the “Great moments in computing” series again today, and it’s the turn of Shor’s algorithm, the breakthrough work that showed it was possible to efficiently factor primes on a quantum computer (with all of the consequences for cryptography … Continue reading Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Learning representations by back-propagating errors

Learning representations by back-propagating errors Rumelhart et al., Nature, 1986 It’s another selection from Martonosi’s 2015 Princeton course on “Great moments in computing” today: Rumelhart’s classic 1986 paper on back-propagation. (Geoff Hinton is also listed among the authors). You’ve almost certainly come across back-propagation before of course, but there’s still a lot of pleasure to … Continue reading Learning representations by back-propagating errors