about summary refs log tree commit diff stats
path: root/js/games/nluqo.github.io/~bh/v3ch0/ack.html
diff options
context:
space:
mode:
authorelioat <elioat@tilde.institute>2023-08-23 07:52:19 -0400
committerelioat <elioat@tilde.institute>2023-08-23 07:52:19 -0400
commit562a9a52d599d9a05f871404050968a5fd282640 (patch)
tree7d3305c1252c043bfe246ccc7deff0056aa6b5ab /js/games/nluqo.github.io/~bh/v3ch0/ack.html
parent5d012c6c011a9dedf7d0a098e456206244eb5a0f (diff)
downloadtour-562a9a52d599d9a05f871404050968a5fd282640.tar.gz
*
Diffstat (limited to 'js/games/nluqo.github.io/~bh/v3ch0/ack.html')
-rw-r--r--js/games/nluqo.github.io/~bh/v3ch0/ack.html79
1 files changed, 79 insertions, 0 deletions
diff --git a/js/games/nluqo.github.io/~bh/v3ch0/ack.html b/js/games/nluqo.github.io/~bh/v3ch0/ack.html
new file mode 100644
index 0000000..5a6e170
--- /dev/null
+++ b/js/games/nluqo.github.io/~bh/v3ch0/ack.html
@@ -0,0 +1,79 @@
+<HTML>
+<HEAD>
+<TITLE>Computer Science Logo Style vol 3:Acknowledgments</TITLE>
+</HEAD>
+<BODY>
+<CITE>Computer Science Logo Style</CITE> volume 3:
+<CITE>Beyond Programming</CITE> 2/e Copyright (C) 1997 MIT
+<H1>Acknowledgments</H1>
+
+<TABLE width="100%"><TR><TD>
+<IMG SRC="../csls3.jpg" ALT="cover photo">
+<TD><TABLE>
+<TR><TD align="right"><CITE><A HREF="http://www.cs.berkeley.edu/~bh/">Brian
+Harvey</A><BR>University of California, Berkeley</CITE>
+<TR><TD align="right"><BR>
+<TR><TD align="right"><A HREF="../pdf/v3ch00.pdf">Download PDF version</A>
+<TR><TD align="right"><A HREF="../v3-toc2.html">Back to Table of Contents</A>
+<TR><TD align="right"><A HREF="preface.html"><STRONG>BACK</STRONG></A>
+chapter thread <A HREF="../v3ch1/v3ch1.html"><STRONG>NEXT</STRONG></A>
+<TR><TD align="right"><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-3">MIT
+Press web page for <CITE>Computer Science Logo Style</CITE></A>
+</TABLE></TABLE>
+
+<HR>
+
+<P>
+As for the previous two volumes, my greatest debts are to Hal Abelson and
+Paul Goldenberg.  Both of them read the manuscript carefully through several
+drafts.  Hal is great at noticing the large problems; he makes comments like
+&quot;throw out this whole chapter&quot; and &quot;you are putting the cart before the
+horse here.&quot;  Paul's comments were generally on a more detailed level,
+pointing out sections in which potentially valuable content was sabotaged by
+a presentation that nobody would understand.  Together they have improved
+the book enormously.
+
+<P>Some of the examples in this book are ones that were posed to me by other
+people in other contexts.  Horacio Reggini raised the issue of listing (not
+merely counting) the combinations of <EM>r</EM> elements of a list;
+Dick White
+asked me to investigate just how secure the Simplex lock is;
+Chris Anderson
+taught the probability class where the question about multinomial expansions
+arose.  I'm grateful to Anita Harnadek, whom I've never met, for
+a logic
+problem I use to demonstrate inference systems.  (She is, by the way, the
+author of a fantastic textbook called <EM>Critical Thinking</EM> that I
+recommend to teachers of almost any subject: math, English, or social
+studies.)  Jim Davis's Logo interpreter in Logo (in the <EM>LogoWorks</EM>
+anthology I co-edited) was an inspiration for the Pascal compiler.
+
+<P>
+I'm grateful to Dan Bobrow, Sherry Turkle, and
+Terry Winograd for permission
+to quote from their work here.  In particular, Bobrow's doctoral thesis
+forms the basis for my chapter on artificial intelligence, and I'm grateful
+for the program design as well as my extensive quotations from the thesis
+itself.  He was also very patient in answering technical questions about
+details of a program he wrote over 20 years ago.
+
+<P>
+Mike Clancy taught me about generating functions and used them to find the
+closed form definition for the multinomial problem; Michael Somos,
+via the <CODE>sci.math</CODE> newsgroup, provided the closed form solution to
+the Simplex lock problem.  Paul Hilfinger straightened me out
+about parser complexity.
+
+<P>
+
+<P><A HREF="../v3-toc2.html">(back to Table of Contents)</A>
+<P><A HREF="preface.html"><STRONG>BACK</STRONG></A>
+chapter thread <A HREF="../v3ch1/v3ch1.html"><STRONG>NEXT</STRONG></A>
+
+<P>
+<ADDRESS>
+<A HREF="../index.html">Brian Harvey</A>, 
+<CODE>bh@cs.berkeley.edu</CODE>
+</ADDRESS>
+</BODY>
+</HTML>
303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413