Anil Nerode

Last updated
Nerode in 2007 Anil Nerode June 2007.jpg
Nerode in 2007

Anil Nerode (born 1932) is an American mathematician, known for his work in mathematical logic and for his many-decades tenure as a professor at Cornell University.

Contents

He received his undergraduate education and a Ph.D. in mathematics from the University of Chicago, the latter under the directions of Saunders Mac Lane. He enrolled in the Hutchins College at the University of Chicago in 1947 at the age of 15, and received his Ph.D. in 1956. His Ph.D. thesis was on an algebraic abstract formulation of substitution in many-sorted free algebras and its relation to equational definitions of the partial recursive functions. [1]

While in graduate school, beginning in 1954, he worked at Professor Walter Bartky's Institute for Air Weapons Research, which did classified work for the US Air Force. He continued to work there following the completion of his Ph.D., from 1956 to 1957. In the summer of 1957 he attended the Cornell NSF Summer 1957 Institute in Logic. In 1958 to 1959 he went to the Institute for Advanced Study in Princeton, New Jersey, where he worked with Kurt Gödel. He also did post-graduate work at University of California, Berkeley. [2]

When in 1959 he got an unsolicited offer of a faculty position at Cornell University, he accepted, in part because on his previous visit to the campus he had thought "it was the prettiest place I'd ever seen". [2] Nerode is Goldwin Smith Professor of Mathematics at Cornell, having been named to that chair in 1991. [2] His interests are in mathematical logic, the theory of automata, computability and complexity theory, the calculus of variations, and distributed systems. With John Myhill, Nerode proved the Myhill–Nerode theorem specifying necessary and sufficient conditions for a formal language to be regular. [3] [4] [5] With Bakhadyr Khoussainov, Nerode founded the theory of automatic structures, an extension of the theory of automatic groups.

The academic year 2019–20 saw Nerode's 60th year as an active faculty member at Cornell, which the university said was its longest such tenure ever. [2] In 2022, the Nerode-90 conference was held online to celebrate his contributions to the field. [6]

Nerode is an Editorial Board member of the journals Annals of Mathematics and Artificial Intelligence, [7] Mathematical and Computer Modelling, [8] Documenta Mathematica [9] and others.

In 2012 he became a fellow of the American Mathematical Society. [10]

Notes

  1. ↑ For a description of Nerode's mathematical work until 1992, see "The Work of Anil Nerode: A Retrospective" co-authored by Nerode's former student J. B. Remmel and J.N. Crossley, which appears in the 1992 Festschrift volume Logical Methods: In Honor of Anil Nerode's Sixtieth Birthday (J. N. Crossley, Jeffrey B. Remmel, Richard A. Shore, and Moss E. Sweedler, eds., Birkhäuser, 1993, ISBN   0-8176-3690-0).
  2. 1 2 3 4 Lefkowitz, Melanie (September 11, 2019). "After years of wandering, longest-serving professor finds a home at Cornell". Cornell Chronicle. Cornell University. Also published in Math Matters newsletter, Cornell University Department of Mathematics, January 2020, p. 2.
  3. ↑ Martin Davis, Elaine J. Weyuker, Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science. Elsevier, 1994, ISBN   978-0-12-206382-4; Ch. 7. Myhill-Nerode theorem.
  4. ↑ John Myhill (Nov 1957). "Finite automata and the representation of events". In Anil Nerode; Burton P. Sauer (eds.). Fundamental Concepts in the Theory of Systems (WADC Technical Report). Wright Air Development Center. pp. 112–137. ASTIA Document No. AD 155741
  5. ↑ Anil Nerode (1958). "Linear Automaton Transformations". Proceedings of the American Mathematical Society. 9 (4): 541–544. doi: 10.1090/S0002-9939-1958-0135681-9 . JSTOR   2033204.
  6. ↑ Math Matters newsletter, Cornell University Department of Mathematics, Winter 2022–2023, p. 10.
  7. ↑ Editorial Board, Annals of Mathematics and Artificial Intelligence, Springer-Verlag. Accessed January 21, 2010
  8. ↑ Editorial Board, Mathematical and Computer Modelling, Elsevier. Accessed January 21, 2010.
  9. ↑ Editorial Board Archived 2013-01-21 at the Wayback Machine , Documenta Mathematica, University of Illinois. Accessed January 21, 2010
  10. ↑ List of Fellows of the American Mathematical Society, retrieved 2013-02-24.

Related Research Articles

In theoretical computer science and formal language theory, a regular language is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science.

<span class="mw-page-title-main">Stephen Cole Kleene</span> American mathematician (1909–1994)

Stephen Cole Kleene was an American mathematician. One of the students of Alonzo Church, Kleene, along with Rózsa Péter, Alan Turing, Emil Post, and others, is best known as a founder of the branch of mathematical logic known as recursion theory, which subsequently helped to provide the foundations of theoretical computer science. Kleene's work grounds the study of computable functions. A number of mathematical concepts are named after him: Kleene hierarchy, Kleene algebra, the Kleene star, Kleene's recursion theorem and the Kleene fixed-point theorem. He also invented regular expressions in 1951 to describe McCulloch-Pitts neural networks, and made significant contributions to the foundations of mathematical intuitionism.

<span class="mw-page-title-main">Dana Scott</span> American logician (born 1932)

Dana Stewart Scott is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory.

In the theory of formal languages, the Myhill–Nerode theorem provides a necessary and sufficient condition for a language to be regular. The theorem is named for John Myhill and Anil Nerode, who proved it at the University of Chicago in 1957.

<span class="mw-page-title-main">Thoralf Skolem</span> Norwegian mathematician

Thoralf Albert Skolem was a Norwegian mathematician who worked in mathematical logic and set theory.

In mathematics and computer science, the syntactic monoid of a formal language is the smallest monoid that recognizes the language .

<span class="mw-page-title-main">Joseph Goguen</span> American computer scientist

Joseph Amadee Goguen was an American computer scientist. He was professor of Computer Science at the University of California and University of Oxford, and held research positions at IBM and SRI International.

John R. Myhill Sr. was a British mathematician.

<span class="mw-page-title-main">Grigore Moisil</span>

Grigore Constantin Moisil was a Romanian mathematician, computer pioneer, and titular member of the Romanian Academy. His research was mainly in the fields of mathematical logic, algebraic logic, MV-algebra, and differential equations. He is viewed as the father of computer science in Romania.

Kazuya Kato is a Japanese mathematician who works at the University of Chicago and specializes in number theory and arithmetic geometry.

Andrei Suslin was a Russian mathematician who contributed to algebraic K-theory and its connections with algebraic geometry. He was a Trustee Chair and Professor of mathematics at Northwestern University.

<span class="mw-page-title-main">Arto Salomaa</span> Finnish mathematician and computer scientist

Arto Kustaa Salomaa is a Finnish mathematician and computer scientist. His research career, which spans over forty years, is focused on formal languages and automata theory.

Dexter Campbell Kozen is an American theoretical computer scientist. He is Professor Emeritus and Joseph Newton Pew, Jr. Professor in Engineering at Cornell University.

Valentina Harizanov is a Serbian-American mathematician and professor of mathematics at The George Washington University. Her main research contributions are in computable structure theory, where she introduced the notion of degree spectra of relations on computable structures and obtained the first significant results concerning uncountable, countable, and finite Turing degree spectra. Her recent interests include algorithmic learning theory and spaces of orders on groups.

<span class="mw-page-title-main">Ronald Brown (mathematician)</span> English mathematician (born 1935)

Ronald Brown FLSW is an English mathematician. Emeritus Professor in the School of Computer Science at Bangor University, he has authored many books and more than 160 journal articles.

<span class="mw-page-title-main">Stephen Lichtenbaum</span> American mathematician

Stephen Lichtenbaum is an American mathematician who is working in the fields of algebraic geometry, algebraic number theory and algebraic K-theory.

Victor Witold Marek, formerly Wiktor Witold Marek known as Witek Marek is a Polish mathematician and computer scientist working in the fields of theoretical computer science and mathematical logic.

<span class="mw-page-title-main">Abraham Ginzburg</span> Israeli academic

Abraham Ginzburg (1926–2020) was a Professor Emeritus of Computer Science. He served as Vice President of the Technion Institute, and President of the Open University of Israel.

Bakhadyr M. Khoussainov is a computer scientist and mathematician, who was born and educated in the Soviet Union, works in the fields of mathematical logic, computability theory, computable model theory and theoretical computer science. With Anil Nerode, he is the co-founder of the theory of automatic structures, which is an extension of the theory of automatic groups.

Jeffrey Brian Remmel was an American mathematician employed by the University of California, San Diego. At the time of his death he held a distinguished professorship—his title was Distinguished Professor of Mathematics; he also held a position as a professor of computer science.

References

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.