Ben Rin presents work on infinitary computers in UK
- July 1, 2012
- Conference marks 100th anniversary of the birth of computer science pioneer Alan Turing
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.
Related News Items
- Language Science Ph.D. student presents work at the annual meeting for the Society for the Neurobiology of Language
- A remarkable shift in attitudes leaves U.S. even more divided on race
- The U.S.-China tariff failure of 2019
- What will Santa Ana do to keep low-income and Latino residents safe from toxic lead?
- Focus of Fed trading furore shifts to Powell's activities