Jason (jcreed) wrote,
Jason
jcreed

Dan Licata just told me a surprising (to me) fact that the homotopy groups of spheres are in fact known to be decidable! That is, there's an algorithm you can run that will tell you what group πkSn is --- but it's reeeeeeally slow. Like exponentially so.

Kenzo appears to contain an implementation of this algorithm, and has a lovely giant user manual written by some CS person who didn't even know any algebraic topology going in, which gives me hope it won't be too over the top with the intense math. I should probably check it out later.
Tags: homotopy, math, topology
Subscribe

  • (no subject)

    After getting home from work immediately appeared to be a traintastrophe in the making, went to see Esther Schor talk about her book "Bridge of…

  • (no subject)

    Thai curry leftovers for dinner. Got a copy of Hennessy and Patterson's textbook on Architecture, and I am enjoying catching up on all the low-level…

  • (no subject)

    Finally the end is in sight for unpacking my books. Heartstrings are pulled over the desire to slim down and get rid of some of them, but so many are…

  • Post a new comment

    Error

    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

  • 0 comments