Miscellaneous
- SICP --MIT site for The Structure and Interpretation of Computer Programs by Abelson and Sussman
- What Every Computer Scientist Should Know About Floating-Point Arithmetic --David Goldberg
- qubit.org -- Quantum computing
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer -- Peter Shor
- Who Can Name the Bigger Number -- Scott Aaronson
- P-versus-NP
- Programming Language Popularity -- latest survey with graphs, courtesy of Peter Lai
- The Complexity Zoo
- Formalizing 100 Theorems -- the formal verification of mathematical proofs. Discussion here
- Amorphous Computing -- home page
- The discovery, on August 6, 2002, of a deterministic algorithm for testing primality (testing whether a number is prime) which runs in polynomial time--discovered by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena of the Indian Institute of Technology in Kanpur--is announced in a NY Times article. Here is a .pdf version of their paper "Primes is in P". There is further discussion here.
- Cryptography Links
- Cryptanalytic Devices -- Slides from a talk by Lana Mahanay, 06. (.pdf)
- TinkerToy Computer -- A Tinkertoy computer that plays tic-tac-toe
- Santa Fe Institute -- Complex Systems
- Society for Chaos Theory
- Biological Computing -- article by Simon Garfinkel (.pdf)
- Alife.org
- Java Applets for Neural Networks and Artificial Life
- Alan Turing Home Page -- Andrew Hodges
- The Turing Test -- Stanford Encyclopedia of Philosophy
- MIT OpenCourseWare
- MacTutor History of Mathematics
- MathWorld -- Wolfram, see Interactive Entries
- Chronology of Personal Computers
- Fibonacci Numbers and the Golden Section -- Ron Knott
- The CPUShack
- Chip Shots -- Photomicrographs of microprocessors
- The End of the Road for Moore's Law -- IBM article
- Chip Advances Chase Moore's Law -- by Farhad Manjoo
Updated 2011