更改

* }}

* }}

''' 约翰·霍顿·康威 John Horton Conway '''<ref name="royal">{{Cite web|url=https://royalsociety.org/people/john-conway-11257/|title=John Conway|last=|first=|date=|website=The Royal Society|url-status=live|archive-url=|archive-date=|access-date=April 11, 2020}}</ref>（生于1937年12月26日，<！-死因尚未得到可靠来源的证实->）是一位活跃于'''有限群 finite groups'''理论的英国数学家，'''纽结理论 knot theory，'''数论 number theory'''，'''组合博弈论 combinatorial game theory'''和'''编码论 coding theory'''。 他还为'''趣味数学 recreational mathematics'''的许多分支做出了贡献，其中最著名的是[[元胞自动机 Cellular Automata]]的发明，[[康威的生命游戏|生命游戏]]。 康威（Conway）先是在英国剑桥大学度过他一半的职业生涯，而在新泽西'''普林斯顿大学'''的新泽西州度过了下半场职业生涯，他获得了'''John von Neumann'''荣誉教授的头衔。 .<ref>{{Cite journal | doi = 10.1080/10586458.1996.10504585| title = Packing Lines, Planes, etc.: Packings in Grassmannian Spaces| journal = Experimental Mathematics| volume = 5| issue = 2| pages = 139| year = 1996| last1 = Conway | first1 = J. H. | last2 = Hardin | first2 = R. H. | last3 = Sloane | first3 = N. J. A. | arxiv = math/0208004}}</ref><ref name="scopus">{{Scopus|id=7402605312}}</ref><ref>{{Cite journal | doi = 10.1109/18.59931| title = A new upper bound on the minimal distance of self-dual codes| journal = IEEE Transactions on Information Theory| volume = 36| issue = 6| pages = 1319| year = 1990| last1 = Conway | first1 = J. H. | last2 = Sloane | first2 = N. J. A. }}</ref><ref>{{Cite journal | doi = 10.1016/0097-3165(93)90070-O| title = Self-dual codes over the integers modulo 4| journal = Journal of Combinatorial Theory, Series A| volume = 62| pages = 30–45| year = 1993| last1 = Conway | first1 = J. H. | last2 = Sloane | first2 = N. J. A. }}</ref><ref>{{Cite journal | doi = 10.1109/TIT.1982.1056484| title = Fast quantizing and decoding and algorithms for lattice quantizers and codes| journal = IEEE Transactions on Information Theory| volume = 28| issue = 2| pages = 227| year = 1982| last1 = Conway | first1 = J.| last2 = Sloane | first2 = N.| url = http://neilsloane.com/doc/Me83.pdf| citeseerx = 10.1.1.392.249}}</ref><ref>{{Cite journal | doi = 10.1016/0097-3165(90)90057-4| title = Tiling with polyominoes and combinatorial group theory| journal = Journal of Combinatorial Theory, Series A| volume = 53| issue = 2| pages = 183| year = 1990| last1 = Conway | first1 = J. H. | last2 = Lagarias | first2 = J. C. }}</ref><ref name=mactutor>MacTutor History of Mathematics archive: [https://www-history.mcs.st-andrews.ac.uk/Biographies/Conway.html John Horton Conway]</ref>

''' 约翰·霍顿·康威 John Horton Conway '''<ref name="royal">{{Cite web|url=https://royalsociety.org/people/john-conway-11257/|title=John Conway|last=|first=|date=|website=The Royal Society|url-status=live|archive-url=|archive-date=|access-date=April 11, 2020}}</ref>（生于1937年12月26日，<！-死因尚未得到可靠来源的证实->）是一位活跃于'''有限群 finite groups'''理论的英国数学家，'''纽结理论 knot theory'''，'''数论 number theory'''，'''组合博弈论 combinatorial game theory'''和'''编码论 coding theory'''。 他还为'''趣味数学 recreational mathematics'''的许多分支做出了贡献，其中最著名的是[[元胞自动机 Cellular Automata]]的发明，'''康威的生命游戏|生命游戏'''。 康威（Conway）先是在英国剑桥大学度过他一半的职业生涯，而在新泽西'''普林斯顿大学'''的新泽西州度过了下半场职业生涯，他获得了'''John von Neumann'''荣誉教授的头衔。 .<ref>{{Cite journal | doi = 10.1080/10586458.1996.10504585| title = Packing Lines, Planes, etc.: Packings in Grassmannian Spaces| journal = Experimental Mathematics| volume = 5| issue = 2| pages = 139| year = 1996| last1 = Conway | first1 = J. H. | last2 = Hardin | first2 = R. H. | last3 = Sloane | first3 = N. J. A. | arxiv = math/0208004}}</ref><ref name="scopus">{{Scopus|id=7402605312}}</ref><ref>{{Cite journal | doi = 10.1109/18.59931| title = A new upper bound on the minimal distance of self-dual codes| journal = IEEE Transactions on Information Theory| volume = 36| issue = 6| pages = 1319| year = 1990| last1 = Conway | first1 = J. H. | last2 = Sloane | first2 = N. J. A. }}</ref><ref>{{Cite journal | doi = 10.1016/0097-3165(93)90070-O| title = Self-dual codes over the integers modulo 4| journal = Journal of Combinatorial Theory, Series A| volume = 62| pages = 30–45| year = 1993| last1 = Conway | first1 = J. H. | last2 = Sloane | first2 = N. J. A. }}</ref><ref>{{Cite journal | doi = 10.1109/TIT.1982.1056484| title = Fast quantizing and decoding and algorithms for lattice quantizers and codes| journal = IEEE Transactions on Information Theory| volume = 28| issue = 2| pages = 227| year = 1982| last1 = Conway | first1 = J.| last2 = Sloane | first2 = N.| url = http://neilsloane.com/doc/Me83.pdf| citeseerx = 10.1.1.392.249}}</ref><ref>{{Cite journal | doi = 10.1016/0097-3165(90)90057-4| title = Tiling with polyominoes and combinatorial group theory| journal = Journal of Combinatorial Theory, Series A| volume = 53| issue = 2| pages = 183| year = 1990| last1 = Conway | first1 = J. H. | last2 = Lagarias | first2 = J. C. }}</ref><ref name=mactutor>MacTutor History of Mathematics archive: [https://www-history.mcs.st-andrews.ac.uk/Biographies/Conway.html John Horton Conway]</ref>