×

Algorithmic barriers falling: P = NP? A conversation with Donald E. Knuth conducted by Edgar G. Daylight on 18 June 2014 in Paris. Edited by Kurt De Grave. (English) Zbl 1335.68003

Conversations 4. Heverlee: Lonely Scholar (ISBN 978-94-91386-04-6/pbk). i, 116 p. (2014).
This book, divided into nine sections, presents a transcript of a conversation between Donald E.Knuth and Edgar G.Daylight which took place in Paris on 18 June 2014. The book, written in an ‘interview style’, uses probing questions to highlight D.E.Knuth’s insight into many areas of computer science, his lifelong achievements into the study of the complexity of algorithms and his views on several historic and contemporary computer science fields. The discussion covers Knuth’s algorithmic contributions, the beginnings of the TeX software, and the open problem of P versus NP in complexity theory, as well as aspects of Knuth’s own professional career. The book concludes with a detailed outline of the relevant bibliography.

MSC:

68-03 History of computer science
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
01A60 History of mathematics in the 20th century
01A65 Development of contemporary mathematics
01A67 Future perspectives in mathematics
01A70 Biographies, obituaries, personalia, bibliographies
68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
68Q25 Analysis of algorithms and problem complexity
68U15 Computing methodologies for text processing; mathematical typography
68W40 Analysis of algorithms
90C60 Abstract computational complexity for mathematical programming problems
PDFBibTeX XMLCite