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
- Should U.S. states be free to close their borders to other U.S. citizens?
- Naturalized citizens could be critical in this fall's election
- The potential of biologically inspired neural modeling with neurorobotics expert, Jeffrey Krichmar
- Opinion: Covid-19 is twisting 2020 beyond all recognition
- Ask a political scientist launches live streaming shows