Joseph F. Traub

From Wikipedia, the free encyclopedia
  (Redirected from Joseph F Traub)
Jump to: navigation, search
Joseph F. Traub
Born Joseph Frederick Traub
(1932-06-24)June 24, 1932
Karlsruhe, Germany[1]
Died August 24, 2015(2015-08-24) (aged 83)
Santa Fe, New Mexico, U.S.[2]
Nationality United States
Fields Computer Science
Institutions Columbia University
Thesis Variational Calculations on the Triplet-2S and Triplet-2P States of Helium (1959)
Doctoral advisor Henry M. Foley
Spouse Pamela McCorduck

Joseph Frederick Traub (June 24, 1932 – August 24, 2015) was an American computer scientist. He was the Edwin Howard Armstrong Professor of Computer Science at Columbia University and External Professor at the Santa Fe Institute. He held positions at Bell Laboratories, University of Washington, Carnegie Mellon, and Columbia, as well as sabbatical positions at Stanford, Berkeley, Princeton, California Institute of Technology, and Technical University, Munich. Traub was the author or editor of ten monographs and some 120 papers in computer science, mathematics, physics, finance, and economics. In 1959 he began his work on optimal iteration theory culminating in his 1964 monograph, which is still in print. Subsequently he pioneered work with Henryk Woźniakowski on computational complexity applied to continuous scientific problems (information-based complexity). He collaborated in creating significant new algorithms including the Jenkins-Traub Algorithm for Polynomial Zeros, as well as the Kung-Traub, Shaw-Traub, and Brent-Traub algorithms. One of his research areas was continuous quantum computing.

From 1971 to 1979 he headed the Computer Science Department at Carnegie Mellon and led it from a critical period to eminence (see Joseph Traub digital archive at Carnegie Mellon). From 1979 to 1989 he was the founding Chair of the Computer Science Department at Columbia. From 1986 to 1992 he served as founding Chair of the Computer Science and Telecommunications Board, National Academies and held the post again 2005-2009. Traub was founding Editor-in-Chief, Journal of Complexity, in 1985 until his death in 2015. Both his research and institution building work have had a major impact on the field of computer science.

Early career[edit]

He attended the Bronx High School of Science where he was captain and first board of the chess team. After graduating from City College of New York he entered Columbia in 1954 intending to take a PhD in physics. In 1955, on the advice of a fellow student, Traub visited the IBM Watson Research Lab at Columbia. At the time, this was one of the few places in the country where a student could gain access to computers. Traub found his proficiency for algorithmic thinking matched perfectly with computers. In 1957 he became a Watson Fellow through Columbia. His thesis was on computational quantum mechanics. His 1959 PhD is in applied mathematics since computer science degrees were not yet available. (Indeed, there was no Computer Science Department at Columbia until Traub was invited there in 1979 to start the Department.)


In 1959 Traub joined the Research Division of Bell Laboratories in Murray Hill, NJ. One day a colleague asked him how to compute the solution of a certain problem. Traub could think of a number of ways to solve the problem. What was the optimal algorithm, that is, a method which would minimize the required computational resources? To his surprise, there was no theory of optimal algorithms. (The phrase computational complexity, which is the study of the minimal resources required to solve computational problems was not introduced until 1965.) Traub had the key insight that the optimal algorithm for solving a continuous problem depended on the available information. This was to eventually lead to the field of information-based complexity. The first area for which Traub applied his insight was the solution of nonlinear equations. This research led to the 1964 monograph Iterative Methods for the Solution of Equations, which is still in print.

In 1966 he spent a sabbatical at Stanford where he met a student named Michael Jenkins. Together they created the Jenkins-Traub Algorithm for Polynomial Zeros. This algorithm is still one of the most widely used methods for this problem and is included in many textbooks.

In 1970 he became a professor at the University of Washington and in 1971 he became Head of the Carnegie Mellon Computer Science Department. The Department was quite small including Gordon Bell, Nico Haberman, Allen Newell, Raj Reddy, Herbert A. Simon, and William Wulf. Just prior to 1971 many faculty had left the Department to take positions elsewhere. Those professors who remained formed a core of world-class scientists recognized as leaders of the discipline. By 1978 the Department had grown to some 50 teaching and research faculty.(See Joseph Traub digital archive at Carnegie Mellon.)

One of Traub's PhD students was H. T. Kung, now a chaired professor at Harvard. They created the Kung-Traub algorithm for comparing the expansion of an algebraic function. They showed that computing the first N terms was no harder than multiplying two N-th degree polynomials. This problem had been worked on by Isaac Newton who missed a key point.

In 1973 he invited Henryk Woźniakowski to visit CMU. They pioneered the field of information-based complexity, co-authoring three monographs and numerous papers. Woźniakowski is now a tenured professor at both Columbia and the University of Warsaw, Poland.

In 1978, while on sabbatical at Berkeley, he was recruited by Peter Likins to become founding Chairman of the Computer Science Department at Columbia and Edwin Howard Armstrong Professor of Computer Science. He served as chair 1979-1989.

In 1980 he co-authored A General Theory of Optimal Algorithms, Academic Press, with Woźniakowski. This was the first research monograph on information-based complexity. Greg Wasilkowski joined Traub and Woźniakowski in two more monographs Information, Uncertainty, Complexity, Addison-Wesley, 1983, and Information-Based Complexity, Academic Press, 1988.

In 1985 Traub became founding Editor-in-Chief of the Journal of Complexity. This was probably the first journal which had complexity in the sense of computational complexity in its title. Starting with two issues and 285 pages in 1985 the Journal now publishes six issues and nearly 1000 pages. Traub continues as Editor-in-Chief.

In 1986, he was asked by the National Academies to form a Computer Science Board. The original name of the Board was the Computer Science and Technology Board (CSTB). Several years later CSTB was asked to also be responsible for telecommunications so it was renamed the Computer Science and Telecommunications Board, preserving the abbreviation CSTB. The Board deals with critical national issues in computer science and telecommunications. Traub served as founding chair 1986-1992 and held the post again 2005-2009.

In 1990 Traub taught in the summer school of the Santa Fe Institute(SFI). He has since played a variety of roles at SFI. In the nineties he organized a series of Workshops on Limits to Scientific Knowledge funded by the Alfred P. Sloan Foundation. The goal was to enrich science in the same way that the work of Gödel and Turing on the limits of mathematics enriched that field. There were a series of Workshops on limits in various disciplines: physics, economics, and geophysics.

Starting in 1991 Traub has been co-organizer of an international Seminar on "Continuous Algorithms and Complexity" at Schloss Dagstuhl, Germany. The ninth Seminar was held in September 2006. Many of the Seminar talks are on information-based complexity and more recently on continuous quantum computing.

Traub was invited by the Accademia Nazionale dei Lincee in Rome, Italy, to present the 1993 Lezione Lincee. He chose to give the cycle of six lectures at the Scuola Normale in Pisa. He invited Arthur Werschulz to join him in publishing the lectures. The lectures appeared in expanded form in Complexity and Information, Cambridge University Press, 1998.

In 1994 he asked a PhD student, Spassimir Paskov, to compare the Monte Carlo method (MC) with the Quasi-Monte Carlo method (QMC) when calculating a collateralized mortgage obligation (CMO) Traub had obtained from Goldman Sachs. This involved the numerical approximation of a number of integrals in 360 dimensions. To the surprise of the research group Paskov reported that QMC always beat MC for this problem. People in finance had always used MC for such problems and the experts in number theory believed QMC should not be used for integrals of dimension greater than 12. Paskov and Traub reported their results to a number of Wall Street firms to considerable initial skepticism. They first published the results in Paskov and Traub Faster Evaluation of Financial Derivatives, Journal of Portfolio Management 22, 1995, 113-120. The theory and software was greatly improved by Anargyros Papageorgiou. Today QMC is widely used in the financial sector to value financial derivatives. QMC is not a panacea for all high dimensional integrals. Research is continuing on the characterization of problems for which QMC is superior to MC.

In 1999 Traub received the Mayor's medal for Science and Technology. Decisions regarding this award are made by the New York Academy of Sciences. The medal was awarded by Mayor Rudy Giuliani in a ceremony in Gracie Mansion, the home of New York City's mayor.

Moore's law is an empirical observation that the number of features on a chip doubles roughly every 18 months. This has held since the early 60s and is responsible for the computer and telecommunications revolution. It is widely believed that Moore's law will cease to hold in 10–15 years using silicon technology. There is therefore interest in creating new technologies. One candidate is quantum computing. That is building a computer using the principles of quantum mechanics. Traub and his colleagues decided to work on continuous quantum computing. The motivation is that most problems in physical science, engineering, and mathematical finance have continuous mathematical models.

In 2005 Traub donated some 100 boxes of archival material to the Carnegie Mellon University Library. This collection is being digitized.

Patents on algorithms and software[edit]

The U.S. patents US5940810 and US0605837 were issued to Traub et al. for the FinDer Software System and were assigned to Columbia University. These patents cover an application of a well known technique (low discrepancy sequences) to a well known problem (valuation of securities).[3]


He had two daughters, Claudia Traub-Cooper and Hillary Spector. He lived in Manhattan and Santa Fe with his wife, noted author Pamela McCorduck whose books include Machines Who think, The Fifth Generation, The Universal Machine, Aaron's Code and The Futures of Women.[4]

Selected honors and distinctions[edit]

Selected publications[edit]

Selected monographs[edit]

  • Iterative Methods for the Solution of Equations, Prentice Hall, 1964. Reissued Chelsea Publishing Company, 1982; Russian translation MIR, 1985; Reissued Amarican Mathematical Society, 1998.
  • Algorithms and Complexity: New Directions and Recent Results, (editor) Academic Press, 1976.
  • Information-Based Complexity, Academic Press, 1988 (with G. Wasilkowski and H. Woźniakowski).
  • Complexity and Information, Cambridge University Press, 1998 (with A. G. Werschulz); Japanese translation, 2000.

Selected papers[edit]

  • Variational Calculations of the 2^3P State of Helium, Phys. Rev. 116, 1959, 914-919.
  • The Future of Scientific Journals, Science 158, 1966, 1153-1159 (with W. S. Brown and J. R. Pierce).
  • A Three-Stage Variable-Shift Iteration for Polynomial Zeros and Its Relation to Generalized Rayleigh Iteration, Numerische mathematik 14, 1970, 252-263 (with M. A. Jenkins).
  • Computational Complexity of Iterative Processes, SIAM Journal on Computing 1, 1972, 167-179.
  • Parallel Algorithms and Parallel Computational Complexity, Proceedings IFIP Congress, 1974, 685-687.
  • Convergence and Complexity of Newton Iteration for Operator Equations, Journal of the ACM 26, 1979, 250-258 (with H. Woźniakowski).
  • All Algebraic Functions Can Be Computed Fast, Journal of the ACM 25, 1978, 245-260 (with H. T. Kung).
  • On the Complexity of Composition and Generalized Composition of Power Series, SIAM Journal on Computing 9, 1980, 54-66 (with R. Brent).
  • Complexity of Linear Programming, Operations Research Letters 1, 1982, 59-62 (with H. Woźniakowski).
  • Information-Based Complexity, Nature 327, July, 1987, 29-33 (with E. Packel).
  • The Monte Carlo Algorithm with a Pseudo-Random Number Generator, Mathematics of Computation 58, 199, 303-339 (with H. Woźniakowski).
  • Breaking Intractability, Scientific American, January, 1994, 102-107 (with H. Woźniakowski). Translated into German, Italian, Japanese and Polish.
  • Linear Ill-Posed Problems are Solvable on the Average for All Gaussian Measures, Math Intelligencer 16, 1994, 42-48 (with A. G. Werschulz).
  • Faster Evaluation of Financial Derivatives, Journal of Portfolio Management 22, 1995, 113-120 (with S. Paskov).
  • A Continuous Model of Computation, Physics Today, May, 1999, 39-43.
  • No Curse of Dimensionality for Contraction Fixed points in the Worst Case, Econometrics, Vol. 70, No. 1, January, 2002, 285-329 (with J. Rust and H. Woźniakowski).
  • Path Integration on a Quantum Computer, Quantum Information Processing, 2003, 365-388 (with H. Woźniakowski).


External links[edit]