Roger Frye
Roger Frye [1] Roger E. Frye,
an American mathematician, data scientist and technical analyst. In the late 80s and early 90s, while affiliated with Thinking Machines, he used massive parallelism to solve several seemingly impossible problems in discrete mathematics. He found the smallest counter-example to Euler’s generalization of Fermat’s Last Theorem [2], wrote the code for the final stage of factoring a 513 bit integer, and demonstrated a 150x speedup over Cray on an NSA benchmark [3].
Selected Publications
1988 …
- Roger Frye (1988). Finding 958004 + 2175194 + 4145604 = 4224814 on the Connection Machine. Thinking Machines Corporation
- S. Lennart Johnsson, Robert L. Krawitz, Roger Frye, Douglas MacDonald (1989). A Radix-2 FFT on the Connection Machine. Supercomputing 89, pdf
- S. Lennart Johnsson, Robert L. Krawitz, Roger Frye, Douglas MacDonald (1989). Cooley-Tukey FFT on the Connection Machine. Parallel Computing, pdf [6]
2000 …
- Roger Jones, Sven G. Redsun, Roger Frye (2003). Entropy Generation by a Maxwell Demon in the Sequential Sorting of the Particles in an Ideal Gas. Complexica Report 031019, arXiv:physics/0311023 [7]
- Roger Jones, Sven G. Redsun, Roger Frye, Kelly D. Myers (2003). The Maxwell Demon and Market Efficiency. Complexica Report 031115, arXiv:physics/0311074
- Roger Jones, Sven G. Redsun, Roger Frye (2004). Information Flow and Computation in the Maxwell Demon Problem. Complexica Report 031128, arXiv:physics/0401002
External Links
References
- ↑ Roger Frye | LinkedIn
- ↑ Roger Frye (1988). Finding 958004 + 2175194 + 4145604 = 4224814 on the Connection Machine. Thinking Machines Corporation
- ↑ Roger Frye | LinkedIn
- ↑ Bradley C. Kuszmaul (1994). Synchronized MIMD Computing. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, MIT, pdf, pp. 146, Acknowledgments
- ↑ Roger E. Frye’s research works in Physics
- ↑ Cooley–Tukey FFT algorithm from Wikipedia
- ↑ Maxwell’s demon from Wikipedia
Prev
RofChadeNext
Roger HC3BCnen