graph
How fast can you tell whether two networks are the same?
A famous question involving networks appears to have come closer to an answer.
Meet the number that's bigger than the observable Universe!
Mathematicians and psychologists don't cross paths that often and when they do you wouldn't expect it to involve an (apparently) unassuming puzzle like the Tower of Hanoi. Yet, the puzzle holds fascination in both fields.
In the 1930s the logician Kurt Gödel showed that if you set out proper rules for mathematics, you lose the ability to decide whether certain statements are true or false. This is rather shocking and you may wonder why Gödel's result hasn't wiped out mathematics once and for all. The answer is that, initially at least, the unprovable statements logicians came up with were quite contrived. But are they about to enter mainstream mathematics?
The human genome is represented by a sequence of 3 billion As, Cs, Gs, and Ts. With such large numbers, sequencing the entire genome of a complex organism isn't just a challenge in biochemistry. It's a logistical nightmare, which can only be solved with clever algorithms.
