An Interview with Joseph F. Traub
Abstract
Joseph F. Traub is the Edwin Howard Armstrong Professor of Computer Science at Columbia University and External Professor, Santa Fe Institute. In this wide-ranging interview, he discusses his early research, organizations and other entities he has created, and offers his view on several open-ended topics on the future of computing.
--Editor
--Editor
References
[1]
W. S. Brown, J. R. Pierce, J. F. Traub, "The future of scientific journals," Science, 158: 1153- 1159 (1966).
[2]
L. Blum, M. Shub, and S. Smale, "On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions, and universal machines", Bull. Amer. Math. Soc. 21: 1- 46 (1989).
[3]
W. S. Brown, J. F. Traub, "MERCURY - A system for the computer aided distribution of technical papers", Journal ACM, 16: 13-25 (1969).
[4]
R. Brent and J. F. Traub, "On the complexity of composition and generalized composition of power series", SIAM Journal Computation, 9: 54-66 (1980).
[5]
M. A. Jenkins and J. F. Traub, "A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration", Numerische Mathematik, 14: 252-263 (1970).
[6]
D. E. Knuth, "Algorithms in mathematics and computer science", in Lecture Notes in Computer Science, G. Goos and J. Hartmanis, editors, 122: 82-99 (1979).
[7]
H. T. Kung and J. F. Traub, "All algebraic functions can be computed fast", Journal ACM, 25: 245-260 (1978).
[8]
M. A. Nielsen, E. L. Chuang, "Quantum Computation and Quantum Information", Cambridge University Press (2000).
[9]
E. Novak, I. Sloan, J. F. Traub, H. Wozniakowski, "Essays on the Complexity of Continuous Problems", European Mathematical Society (2009).
[10]
E. Novak and H. Wozniakowski, "Tractability of Multivariate Problems, vol. 1, Linear Information", European Mathematical Society (2008).
[11]
S. Paskov, J. F. Traub "Faster evaluation of financial derivatives", Journal of Portfolio Management, 22: 113-120 (1995).
[12]
A. Papageorgiou, J. F. Traub, "Beating Monte Carlo", RISK, 9: 63-65 (1996).
[13]
A. Papageorgiou, J. F. Traub, "Quantum algorithms and complexity for continuous problems", in Springer Encylopedia of Complexity and Systems Science, 8: 7118-7135 (2009).
[14]
A. Papageorgiou, J. F. Traub, "Qubit complexity of continuous problems", J. Fixed Point Theory and Applications, 6, no. 2: 295-304 (2009).
[15]
M. Shaw and J. F. Traub, "On the number of multiplications for the evaluation of a polynomial and some of its derivatives", Journal ACM, 21: 161-167 (1974).
[16]
J. F. Traub, "Functional iteration and the calculation of roots", Proceedings, National ACM Conference: 5A-1 - 5A-4 (1961).
[17]
J.F. Traub, "Iterative Methods for the Solution of Equations", Prentice-Hall (1964). Reissued, American Mathematical Society (1998).
[18]
J. F. Traub, "A class of globally convergent iteration functions for the solution of polynomial equations", Math. Comp., 20: 113-138 (1966).
[19]
"Complexity of Sequential and Parallel Numerical Algorithms", J. F. Traub, editor, Academic Press (1973).
[20]
J. F. Traub, "Parallel algorithms and parallel computational complexity", Proceedings IFIP Congress: 685-687 (1974).
[21]
J. F. Traub, "From infoware to infowar," in "Defining a Decade: Envisioning CSTB's Second Ten Years", National Academy Press: 1-7 (1997).
[22]
J. F. Traub, "A continuous model of computation", Physics Today, 52, No. 5: 39-43 (1999).
[23]
J. F. Traub, "A brief history of information based complexity", in "Essays on the Complexity of Continuous Problems", European Mathematical Society: 61-71 (2009).
[24]
J. F. Traub and H. Wozniakowski, "A General Theory of Optimal Algorithms", Academic Press (1980).
[25]
J. F. Traub and A. G. Werschulz, "Complexity and Information", Cambridge University Press (1998).
[26]
J. F. Traub, G. Wasilkowski, and H. Wozniakowski, "Information, Uncertainty, Complexity", Addison-Wesley (1983).
[27]
J. F. Traub, G. Wasilkowski, and H. Wozniakowski, "Information-based Complexity", Academic Press (1988).
[28]
P. van Emde Boas, "Machine models and simulations". Pp.1-66 of: van Leeweun, J. (ed.) Handbook of Theoretical Computer Science: vol. A, Algorithms and Complexity, MIT Press (1990).
[29]
"Jenkins-Traub algorithm", Wikipedia.
[30]
"Quasi-Monte Carlo methods in finance", Wikipedia.
Index Terms
- An Interview with Joseph F. Traub
Recommendations
Joseph Hardin: NCSA Mosaic
Joseph Hardin describes the emergence of Mosaic and the rise of the browser. The first Web extra at http://youtu.be/-c8iWUh3Sv4 is a video interview in which author Charles Severance speaks with Joseph Hardin about the development of the Mosaic browser ...
Interview with Joseph Olin
Theoretical and Practical Computer Applications in EntertainmentJoseph Olin is the President of the Academy of Interactive Arts and Sciences (AIAS). He oversees the annual DICE Conference and Interactive Achievement Awards. Prior to AIAS, he spearheaded the introduction of gaming's most famous heroine, Lara Croft. ...
Walter Carlson interview: November 26-27, 2005; Los Gatos, California
ACM Oral History interviewsWalter Carlson discusses his entire career in the computing field. Born in Denver in 1916, Carlson studied Chemical Engineering at the University of Colorado, gaining both bachelors and masters degrees in Chemical Engineering. On graduation Carlson went to ...
Comments
Information & Contributors
Information
Published In
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 February 2011
Published in UBIQUITY Volume 2011, Issue February
Check for updates
Qualifiers
- Interview
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 12,308Total Downloads
- Downloads (Last 12 months)492
- Downloads (Last 6 weeks)53
Reflects downloads up to 27 Feb 2025
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderMagazine Site
View this article on the magazine site (external)
Magazine SiteLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in