Ben Rin, LPS graduate student, recently presented a paper entitled "The Computational Strengths of  Alpha-length Infinite Time Turing Machines" at the 2012 Computability in Europe (CiE) conference, held in Cambridge, England June 18-23. The CiE conferences are the largest annual international meetings covering the full range of research on computability. This year's conference was part of a series of events held in honor of Alan Turing, the pioneering British computer scientist responsible for the invention of the "Turing machine," a hypothetical device that can, in principle, execute any computer program and which is therefore useful in analyzing many problems in computer science and logic. Rin's paper, which will form part of his dissertation, explored a generalization of the Turing machine with an infinite amount of memory.

 

© UC Irvine School of Social Sciences - 3151 Social Sciences Plaza, Irvine, CA 92697-5100 - 949.824.2766