One line. Many voicesSeek and you shall find

www.crm.cat

A single ball on a fixed table can compute: Eva Miranda and Isaac Ramos prove that two-dimensional billiards are Turing complete - Centre de Recerca Matemàtica

  • Listen15:00
  • Save1 save
  • A single point particle bouncing in a fixed planar billiard table can simulate a universal Turing machine, proving two‑dimensional billiards are computationally universal.

    Waiting on you

    Sign upLog in

    read later

    For all the tabs you promised to read.
    Save to read. Read to clear.