Alex Smith discovered that the Turing machine that can be considered universal is incredibly simple compared to the ones that were previously known, which highlights that computation universality is closer than we might have thought. However, the actual methods are not illuminated and lack elegance.