25,161
edits
Changes
Created page with "'''Home * People * Roger Frye''' FILE:RogerFrye.jpg|border|right|thumb|240px| Roger Frye <ref>[https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye |..."
'''[[Main Page|Home]] * [[People]] * Roger Frye'''
[[FILE:RogerFrye.jpg|border|right|thumb|240px| Roger Frye <ref>[https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye | LinkedIn]</ref> ]]
'''Roger E. Frye''',<br/>
an American mathematician, data scientist and technical analyst. In the late 80s and early 90s, while affiliated with [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines], he used massive parallelism to solve several seemingly impossible problems in [https://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics].
He found the smallest counter-example to [https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture Euler’s generalization] of [https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem Fermat’s Last Theorem] <ref>[[Roger Frye]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/74138 Finding 95800<span style="vertical-align: super;">4</span> + 217519<span style="vertical-align: super;">4</span> + 414560<span style="vertical-align: super;">4</span> = 422481<span style="vertical-align: super;">4</span> on the Connection Machine]''. [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation]</ref>, wrote the code for the final stage of [https://en.wikipedia.org/wiki/Factorization factoring] a 513 bit integer, and demonstrated a 150x speedup over Cray on an [https://en.wikipedia.org/wiki/National_Security_Agency NSA] benchmark <ref>[https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye | LinkedIn]</ref>.
=StarTech=
Roger E. Frye contributed to the [[StarTech]] project, as mentioned by [[Bradley Kuszmaul]] in his thesis acknowledgments <ref>[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf], pp. 146, Acknowledgments</ref>:
[[Mark Bromley]], [[Roger Frye]], and [[Kurt Thearling]] provided important design and programming help in getting StarTech running on the [[Connection Machine|CM-5]]. Roger almost singlehandedly built the interface between the [[HiTech]] code and the parallel computer ...
=Selected Publications=
==1988 ...==
* [[Roger Frye]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/74138 Finding 95800<span style="vertical-align: super;">4</span> + 217519<span style="vertical-align: super;">4</span> + 414560<span style="vertical-align: super;">4</span> = 422481<span style="vertical-align: super;">4</span> on the Connection Machine]''. [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation]
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [https://dblp.uni-trier.de/pers/hd/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [https://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''A Radix-2 FFT on the Connection Machine''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5348943 Supercomputing 89], [http://www.cs.yale.edu/publications/techreports/tr734.pdf pdf]
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [https://dblp.uni-trier.de/pers/hd/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [https://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''Cooley-Tukey FFT on the Connection Machine''. [http://www.journals.elsevier.com/parallel-computing/ Parallel Computing], [http://www.cs.yale.edu/publications/techreports/tr750.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm Cooley–Tukey FFT algorithm from Wikipedia]</ref>
==2000 ...==
* [https://en.wikipedia.org/wiki/Roger_Jones_(physicist) 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, [https://arxiv.org/abs/physics/0311023 arXiv:physics/0311023] <ref>[https://en.wikipedia.org/wiki/Maxwell%27s_demon Maxwell's demon from Wikipedia]</ref>
* [https://en.wikipedia.org/wiki/Roger_Jones_(physicist) Roger Jones], Sven G. Redsun, [[Roger Frye]], Kelly D. Myers ('''2003'''). ''The Maxwell Demon and Market Efficiency''. Complexica Report 031115, [https://arxiv.org/abs/physics/0311074 arXiv:physics/0311074]
* [https://en.wikipedia.org/wiki/Roger_Jones_(physicist) Roger Jones], Sven G. Redsun, [[Roger Frye]] ('''2004'''). ''Information Flow and Computation in the Maxwell Demon Problem''. Complexica Report 031128, [https://arxiv.org/abs/physics/0401002 arXiv:physics/0401002]
=External Links=
* [https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye | LinkedIn]
* [https://proofwiki.org/wiki/Mathematician:Roger_E._Frye Mathematician:Roger E. Frye - ProofWiki]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Frye]]
[[Category:Chess Programmer|Frye]]
[[FILE:RogerFrye.jpg|border|right|thumb|240px| Roger Frye <ref>[https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye | LinkedIn]</ref> ]]
'''Roger E. Frye''',<br/>
an American mathematician, data scientist and technical analyst. In the late 80s and early 90s, while affiliated with [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines], he used massive parallelism to solve several seemingly impossible problems in [https://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics].
He found the smallest counter-example to [https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture Euler’s generalization] of [https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem Fermat’s Last Theorem] <ref>[[Roger Frye]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/74138 Finding 95800<span style="vertical-align: super;">4</span> + 217519<span style="vertical-align: super;">4</span> + 414560<span style="vertical-align: super;">4</span> = 422481<span style="vertical-align: super;">4</span> on the Connection Machine]''. [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation]</ref>, wrote the code for the final stage of [https://en.wikipedia.org/wiki/Factorization factoring] a 513 bit integer, and demonstrated a 150x speedup over Cray on an [https://en.wikipedia.org/wiki/National_Security_Agency NSA] benchmark <ref>[https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye | LinkedIn]</ref>.
=StarTech=
Roger E. Frye contributed to the [[StarTech]] project, as mentioned by [[Bradley Kuszmaul]] in his thesis acknowledgments <ref>[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf], pp. 146, Acknowledgments</ref>:
[[Mark Bromley]], [[Roger Frye]], and [[Kurt Thearling]] provided important design and programming help in getting StarTech running on the [[Connection Machine|CM-5]]. Roger almost singlehandedly built the interface between the [[HiTech]] code and the parallel computer ...
=Selected Publications=
==1988 ...==
* [[Roger Frye]] ('''1988'''). ''[https://ieeexplore.ieee.org/document/74138 Finding 95800<span style="vertical-align: super;">4</span> + 217519<span style="vertical-align: super;">4</span> + 414560<span style="vertical-align: super;">4</span> = 422481<span style="vertical-align: super;">4</span> on the Connection Machine]''. [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation]
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [https://dblp.uni-trier.de/pers/hd/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [https://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''A Radix-2 FFT on the Connection Machine''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5348943 Supercomputing 89], [http://www.cs.yale.edu/publications/techreports/tr734.pdf pdf]
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [https://dblp.uni-trier.de/pers/hd/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [https://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''Cooley-Tukey FFT on the Connection Machine''. [http://www.journals.elsevier.com/parallel-computing/ Parallel Computing], [http://www.cs.yale.edu/publications/techreports/tr750.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm Cooley–Tukey FFT algorithm from Wikipedia]</ref>
==2000 ...==
* [https://en.wikipedia.org/wiki/Roger_Jones_(physicist) 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, [https://arxiv.org/abs/physics/0311023 arXiv:physics/0311023] <ref>[https://en.wikipedia.org/wiki/Maxwell%27s_demon Maxwell's demon from Wikipedia]</ref>
* [https://en.wikipedia.org/wiki/Roger_Jones_(physicist) Roger Jones], Sven G. Redsun, [[Roger Frye]], Kelly D. Myers ('''2003'''). ''The Maxwell Demon and Market Efficiency''. Complexica Report 031115, [https://arxiv.org/abs/physics/0311074 arXiv:physics/0311074]
* [https://en.wikipedia.org/wiki/Roger_Jones_(physicist) Roger Jones], Sven G. Redsun, [[Roger Frye]] ('''2004'''). ''Information Flow and Computation in the Maxwell Demon Problem''. Complexica Report 031128, [https://arxiv.org/abs/physics/0401002 arXiv:physics/0401002]
=External Links=
* [https://www.linkedin.com/in/roger-frye-a38bb879 Roger Frye | LinkedIn]
* [https://proofwiki.org/wiki/Mathematician:Roger_E._Frye Mathematician:Roger E. Frye - ProofWiki]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Frye]]
[[Category:Chess Programmer|Frye]]
