Side-by-side reference sheets for common programming tasks.

Great introduction to algorithmic information theory. Explains Kolmogorov complexity, Solomonoff probability, Levins Kt-complexity, "Martin-Loef" randomness, ...

Will a certain number sequence (n even: n/2; n odd: 3n+1) always end the same way, regardless of the starting number? Unsolved conjecture.

If positive solutions to a yes/no problem can be verified quickly in polynomial time, can the answers also be computed quickly in polynomial time? There is no proof one way or the other yet.

States that the Boolean satisfiability problem is NP-complete. The Cook-Levin theorem was the first proof of NP-completeness for any problem.

Reasons why general AI may be accomplished, with effective, diligent effort, within 10 to 30 years.

Founding, early years and recent progress of SIAI.

Existential risks are risks that threaten humanity's existence.

The set of all properties expressible in existential second-order logic is precisely the complexity class NP. It is remarkable since it is a characterisation of the class NP which does not invoke a model of computation such as a Turing machine.

A systematic ontology of concepts, projects and resources relevant to Artificial General Intelligence.

Scary and common: Argument by selective reading, misunderstanding the nature of statistics, causal reductionism, excluded middle.

Smarter-than-human intelligence. That's all.

For any consistent formal theory that proves basic arithmetical truths, it is possible to construct an arithmetical statement that is true but not provable in the theory. That is, any consistent theory of a certain expressive strength is incomplete.

Finds the shortest path between any two Wikipedia entries.

Probably the largest collection of defintions of intelligence.