A Conversation With Erik Demaine.

An interview with Kayatangi Prize winner Erik Demaine is presented. He notes that computational complexity theory is inapplicable for games like Chess, Checkers and Go, however there is an algorithmic solution to Nim. Demaine is engaged in solving protein folding. He also shares his works on geometry, algorithms and foldings and their impact on the modern life.