HN 日本語サマリー

← 一覧へ戻る
プログラミング

The Art of Computer Programming by Donald E. Knuth

The Art of Computer Programming by Donald E. Knuth (www-cs-faculty.stanford.edu)

161 pointsby archargelod43 コメント

要約

ドナルド・E・クヌースによる「The Art of Computer Programming (TAOCP)」は、コンピュータプログラミングのアルゴリズムと理論に関する包括的なシリーズです。このページでは、書籍の最新情報、ニュースレター登録、および電子書籍版に関する詳細が提供されています。特に、PDF版はクヌース氏自身が承認しており、非公式な電子書籍版の品質について注意喚起がされています。

全文翻訳

The Art of Computer Programming (TAOCP)

by Donald E. Knuth.

The Art of Computer Programming Newsletterに登録すると、新版やプロモーションに関する最新情報が届きます。

[画像]TAOCP、1968–2015、Héctor García-Molina撮影

1999年末、これらの書籍は、American Scientist によって、その世紀の最も優れた物理科学のモノグラフ12冊の一つに選ばれました。他の選ばれた書籍には、量子力学に関するDirac、相対性理論に関するEinstein、フラクタルに関するMandelbrot、化学結合に関するPauling、数学の基礎に関するRussell and Whitehead、ゲーム理論に関するvon Neumann and Morgenstern、サイバネティクスに関するWiener、軌道対称性に関するWoodward and Hoffmann、量子電磁力学に関するFeynman、構造の探求に関するSmith、そしてEinsteinの論文集が含まれます。素晴らしいことです!

第1巻(1968年)初版の出版社の歴史的なパンフレットを見る

5巻セットの登録所有者向けに、出版社から収集された索引のダウンロード可能なPDFが無料で提供されています。このPDFには、第1巻、第2巻、第3巻、第4A巻、第4B巻の完全な索引と、第1巻ファスシクル1の索引が含まれています。以前の4巻セットの登録所有者も同様に、以前の索引集のダウンロードが可能です。この以前のコレクションには、第1巻、第2巻、第3巻、第4A巻、第1巻ファスシクル1、および第4巻ファスシクル5と6が含まれます。

電子書籍版

これらの巻は、PDF形式のポータブル電子形式でも利用可能になりました。検索機能がうまく機能するように特別な配慮がなされています。数千もの有用な「クリック可能な」相互参照も提供されています — 演習から解答へ、解答から演習へ、索引から本文へ、本文から重要な表や図へなど。

注意: 残念ながら、私の推奨に反してPDF以外の形式のバージョンも登場しましたが、それらは率直に言って非常にひどいものです。この作業を正しく行うには、多大な専門知識と注意が必要です。もし、これらの劣悪なバージョン(例えばKindle版)を購入してしまった場合、出版社は私の個人的に承認したPDF版と交換してくれるとのことです。数学的な意味を理解したいのであれば、Kindle形式のeTAOCPは購入しないでください。 (ePUB形式も同様に悪い可能性があります。私は知りたくもなく、リリースされたことを本当に残念に思っています。) PDFを装った非PDFバージョンも存在します。

正規のPDFバージョンはwww.informit.com/taocpで購入できます。

PDFかどうかにかかわらず、電子書籍版で見つけた誤りについて、印刷版にも同じ誤りが存在しない限り、私に知らせないでください。そのような間違いは直接出版社に報告されるべきです。

第1巻

Fundamental Algorithms, Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp. ISBN 0-201-89683-4
Volume 1 Fascicle 1, MMIX: A RISC Computer for the New Millennium (2005), v+134pp. ISBN 0-201-85392-2

以前のエディションの翻訳:
Romanian translation by Adrian Davidoviciu, Adrian Petrescu, Smaranda Dimitriu, and Paul Zamfirescu, Tratat de programarea calculatoarelor, V. 1: Algoritmi fundamentali (Bucharest: Editura tehnica, 1974), 676pp.
Russian translation by Galina P. Babenko and Iu. M. Baiakovskii, edited by K. I. Babenko, and V. S. Shtarkman, Iskusstvo programmirovaniia dlia ÉVM, T. 1: Osnovnye algoritmy (Moscow: Mir, 1976), 735pp.
Japanese translation, under direction of Takakazu Simauti, in two volumes:

  • Chapter 1, by Ken Hirose, 基本算法 / 基礎概念 (Tokyo: Saiensu-Sha, 1978), 22+331pp.;
  • Chapter 2, by Nobuo Yoneda and Katsuhiko Kakehi, 基本算法 / 情報構造 (Tokyo: Saiensu-Sha, 1978), 8+373pp.

Chinese translation by Guan JiWen and Su Yunlin, 计算机程序设计技巧, 1. 卷: 基本算法 (Beijing: Defense Industry Publishing Co., 1980), 14+573pp.
Spanish translation by Michel Antscherl Harlange and Joan Lluis i Biset, under direction of Ramón Puigjaner i Trepat, El Arte de Programar Ordenadores, V. 1: Algoritmos Fundamentales (Barcelona: Reverté, 1980), xxiii+672pp.
Hungarian translation, under direction of Miklós Simonovits, A számítógép-programozás művészete, V. 1: Alapvető algoritmusok (Budapest: Műszaki Könyvkiadó, 1987), 654pp.

第3版の翻訳:
Russian translation by S. G. Trigub, Yu. G. Gordienko, and I. V. Krasikov, edited by S. N. Trigub and directed by Yu. V. Kozachenko, Iskusstvo programmirovaniia, T. 1: Osnovnye algoritmy (Moscow: Vil'iams, 2000), 713pp
Chinese translation by Su Yunlin, 计算机程序设计艺术, 1. 卷: 基本算法 (Beijing: National Defense Industry Press, 2002), xx+625pp.
Chinese translation by Li Bomin, Fan Ming, and Jiang Aijun, 计算机程序设计艺术, 1. 卷: 基本算法 (Beijing: Posts & Telecom Press, 2016), xv+517pp.
Polish translation by G. Jakacki, Sztuka Programowania, T. 1: Algorytmy Podstawowe (Warsaw: Wydawnictwa Naukowo-Techniczne, 2002), xxiv+679pp.
Romanian translation by Mihaela Târpa, Arta programării calculatoarelor, V. 1: Algoritmi fundamentali (Bucharest: Editura Teora Bucuresti, 2002), 616pp.
Japanese translation by Takashi Aoki, Kazuhiko Kakehi, Kenichi Suzuki, and Takahiro Nagao, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Corporation, 2004), xxii+632pp. Republished (softcover) by ASCII DWANGO in 2015.
Korean translation by Ryu Gwang, 컴퓨터 프로그래밍의 예술 1: 기초 알고리즘 (Seoul: Hanbit Media, 2006), 793pp.
Czech translation by David Krásenský, Umění programování, 1. díl: Základní algoritmy (Brno: Computer Press, 2008), xx+649pp.
Macedonian translation by Aristotel Tentov, Umetnosta na kompjuterskoto programiranje, T. 1, Fundamentalni algoritmi (Skopje: Prosvetno Delo, 2009), 724pp.
Albanian translation by Visar Zejnulahu, Arti i programimit kompjuterik, V. 1, Algoritma fundamentalë (Skopje: Prosvetno Delo, 2009), xx+680pp.
Greek translation by Manos Roumeliotis and Stavros Souraklas (Athens: Tziolas Publications, 2010), 751pp.

ファスシクルの翻訳:
Romanian translation of Volume 1 Fascicle 1, by Ioan Bledea: MMIX: Un calculator RISC pentru noul mileniu (Bucharest: Editura Teora, 2005), ix+149pp.
Japanese translation of Volume 1 Fascicle 1, by Takashi Aoki, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Corporation, 2006), vii+134pp.
Republished (softcover) by ASCII DWANGO in 2015.
Chinese translation of Volume 1, Fascicle 1, by Su Yunlin (Beijing: China Machine Press, 2006), 268pp.
Chinese translation of Volume 1, Fascicle 1, by Jiang Zhiqiang and Huang Zhibin (Beijing: Posts & Telecom Press, 2020), viii+308pp.
Russian translation of Volume 1 Fascicle 1, by Yu. G. Gordienko, edited by S. N. Trigub, MMIX --- RISC-komp'iuter dlia novogo tysiacheletiia (Moscow: Vil'iams, 2007), 151pp.
Polish translation of Volume 1 Fascicle 1, by G. Jakacki: MMIX --- komputer na nowe tysiąclecie (Warsaw: Wydawnictwa Naukowo-Techniczne, 2008), xii+146pp.
Hungarian translation of Volume 1 Fascicle 1, under the direction of Antal Iványi: MMIX. RISC számítógép a következő évezredre (Budapest: AnTonCom Infokommunikációs Kft., 2009), 168pp.

第2巻

Seminumerical Algorithms, Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp.
ISBN 0-201-89684-2

以前のエディションの翻訳:
Russian translation by Galina P. Babenko, É. G. Belaga, and L. V. Maiorov, edited by K. I. Babenko, Iskusstvo programmirovaniia dlia ÉVM, T. 2: Poluchislennye algoritmy (Moscow: Mir, 1977), 724pp.
Japanese translation, under direction of Takakazu Simauti, in two volumes:

  • Chapter 3, by Masaaki Sibuya, 数値計算 / ランダム数 (Tokyo: Saiensu-Sha, 1982), ii+259pp.;
  • Chapter 4, by Keisuke Nakagawa, 数値計算 / 計算精度 (Tokyo: Saiensu-Sha, 1986), xii+536pp.

Romanian translation by Florian Petrescu, Ioan Georgescu, Rolanda Predescu, and Paul Zamfirescu, Tratat de programarea calculatoarelor, V. 2: Algoritmi seminumerici (Bucharest: Editura tehnica, 1983), 722pp.
Chinese translation by Guan JiWen and Su Yunlin, 计算机程序设计技巧, 2. 卷: 半数值算法 (Beijing: Defense Industry Publishing Co., 1992), 10+622pp.
Hungarian translation, under direction of Miklós Simonovits, A számítógép-programozás művészete, V. 2: Szeminumerikus algoritmusok (Budapest: Műszaki Könyvkiadó, 1987), 690pp.

第3版の翻訳:
Russian translation by L. F. Kozachenko, V. T. Tertyshnyi, and I. V. Krasikov, edited by S. N. Trigub and directed by Yu. V. Kozachenko, Iskusstvo programmirovaniia, T. 2: Poluchislennye algoritmy (Moscow: Vil'iams, 2000), 830pp.
German translation of Chapter 4 by Rüdiger Loos Arithmetik (Heidelberg: Springer Verlag, 2001), xiii+538pp.
Chinese translation by Su Yunlin, 计算机程序设计艺术, 2. 卷: 半数值算法 (Beijing: National Defense Industry Press, 2002), xii+760pp.
Chinese translation by Wu Bin and Fan Ming, 计算机程序设计艺术, 2. 卷: 半数值算法 (Beijing: Posts & Telecom Press, 2016), x+603pp.
Romanian translation by Mihaela Târpa, Cora Radulian, and Mihai Iosif, Arta programării calculatoarelor, V. 2: Algoritmi seminumerici (Bucharest: Editura Teora Bucuresti, 2002), 663pp.
Polish translation by Adam Malinowski, Sztuka Programowania, T. 2: Algorytmy Seminumeryczne (Warsaw: Wydawnictwa Naukowo-Techniczne, 2002), xviii+820pp.
Japanese translation by Hiroaki Saito, Takahiro Nagao, Shogo Matsui, Takao Matsui, and Hitoshi Yamauchi, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Corporation, 2004), xvi+725pp. Republished (softcover) by ASCII DWANGO in 2015.
Korean translation by Ryu Gwang, 컴퓨터 프로그래밍의 예술 2: 준수치적 알고리즘 (Seoul: Hanbit Media, 2007), 933pp.
Greek translation by Manos Roumeliotis and Stavros Souraklas (Athens: Tziolas Publications, 2010), 911pp.
Czech translation by David Krásenský, Umění programování, 2. díl: Seminumerické algoritmy (Brno: Computer Press, 2010), xii+763pp.

第3巻

Sorting and Searching, Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout.
ISBN 0-201-89685-0

初版の翻訳:
Romanian translation by Rodica Boconcios, A. Davidoviciu, P. Dimo, Fl. Moraru, A. Petrescu, I. Sipos, and Smaranda Dimitriu, Tratat de programarea calculatoarelor, V. 3: Sortare şi căutare (Bucharest: Editura tehnica, 1976), xii+736pp.
Russian translation by Nadezhda I. V'iukova, V. A. Galatenko, and A. B. Khodulev, edited by Iu. M. Baiakovskii and V. S. Shtarkman, Iskusstvo programmirovaniia dlia ÉVM, T. 3: Sortirovka i poisk (Moscow: Mir, 1978), 844pp.
Chinese translation by Guan JiWen and Su Yunlin, 计算机程序设计技巧, 3. 卷: 排序和查找 (Beijing: Defense Industry Publishing Co., 1985), viii+645pp.
Spanish translation by Jaime de Argila y de Chopitea and Ramón Puigjaner Trepat, under direction of Ramón Puigjaner Trepat, El Arte de Programar Ordenadores, V. 3: Clasificación y Búsqueda (Barcelona: Reverté, 1980), xxiii+672pp.
Hungarian translation, under direction of Miklós Simonovits, A számítógép-programozás művészete, V. 3: Keresés és rendezés (Budapest: Műszaki Könyvkiadó, 1988), 761pp.

第2版の翻訳:
Russian translation by V. T. Tertyshnyi and I. V. Krasikov, edited by S. N. Trigub and directed by Yu. V. Kozachenko, Iskusstvo programmirovaniia, T. 3: Sortirovka i poisk (Moscow: Vil'iams, 2000), 823pp.
Chinese translation by Su Yunlin, 计算机程序设计艺术, 3. 卷: 排序与查找 (Beijing: National Defense Industry Press, 2002), x+779pp.
Chinese translation by Jia Hongfeng, 计算机程序设计艺术, 3. 卷: 排序与查找 (Beijing: Posts & Telecom Press, 2017), x+632pp.
Polish translation by K. Diks and A. Malinowski, Sztuka Programowania, T. 3: Sortowanie i Wyszukiwanie (Warsaw: Wydawnictwa Naukowo-Techniczne, 2002), xviii+838pp.
Romanian translation by Mihaela Târpa, Arta programării calculatoarelor, V. 3: Sortare şi căutare (Bucharest: Editura Teora Bucuresti, 2002), 680pp.
Japanese translation by Yuichiro Ishii, Hiroshi Ichiji, Hiroshi Koide, Eiko Takaoka, Kumiko Tanaka, and Takahiro Nagao, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Media Works, 2006), xvi+741pp. Republished (softcover) by ASCII DWANGO in 2015.
Korean translation by Ryu Gwang, 컴퓨터 프로그래밍의 예술 3: 정렬 과 검색 (Seoul: Hanbit Media, 2007), 941pp.
Greek translation by Manos Roumeliotis and Stavros Souraklas (Athens: Tziolas Publications, 2010), 926pp.

第4A巻

Combinatorial Algorithms, Part 1 (Upper Saddle River, New Jersey: Addison-Wesley, 2011), xvi+883pp.
ISBN 0-201-03804-8

(Preliminary drafts were previously published as paperback fascicles; see below.)

Russian translation (Moscow: Dialektika, 2019), 955pp.
Japanese translation by Kazuhiko Kakehi and Hiroshi Koide, and Eiiti Wada, supervised by Eiiti Wada (Tokyo: ASCII DWANGO, 2017), xvi+866pp.
Chinese translation by Li Bomin and Jia Hongfeng (Beijing: Posts & Telecom Press, 2019), xii+731pp.
Korean translation by Ryu Gwang, 컴퓨터 프로그래밍의 예술 4A: 조합적 알고리즘 1부 (Seoul: Hanbit Media, 2013), xxiv+1160pp.

第4B巻

Combinatorial Algorithms, Part 2 (Upper Saddle River, New Jersey: Addison-Wesley, 2023), xviii+714pp.
ISBN 0-201-03806-4

(Preliminary drafts were previously published as paperback fascicles; see below.)

Japanese translation by Hideya Iwasaki, Naoyuki Tamura, Minoru Terada, and Eiiti Wada, supervised by Eiiti Wada (Tokyo: ASCII DWANGO, 2023), xx+708pp.

Chinese translation by Xiongxin Yang, Guang Hu, Xihan Li, and Fei Liu (Beijing: Posts & Telecom Press, 2025), xviii+590pp.

第4巻の残りの部分

現在の計画では、第4A巻と第4B巻は、Combinatorial Algorithms, Part 1, 2, 3, ... と題された複数のサブボリュームの最初のものとなります。現在準備中の残りのサブボリュームは、以下の一般的な概要を持つ予定です:

  • 7.2.2.3. 制約充足
  • 7.2.2.4. ハミルトン路とサイクル
  • 7.2.2.5. クリック
  • 7.2.2.6. カバー
  • 7.2.2.7. スクエア
  • 7.2.2.8. パズル詰め合わせ
  • 7.2.2.9. バックトラックコストの推定
  • 7.2.3. 等価でないパターンの生成
  • 7.3. 最短経路
  • 7.4. グラフアルゴリズム
  • 7.4.1. 成分とトラバーサル
  • 7.4.1.1. Union-findアルゴリズム
  • 7.4.1.2. 深さ優先探索
  • 7.4.1.3. 頂点および辺の連結性
  • 7.4.2. 特殊なクラスのグラフ
  • 7.4.3. エクスパンダーグラフ
  • 7.4.4. ランダムグラフ
  • 7.5. グラフと最適化
  • 7.5.1. 二部マッチング
  • 7.5.2. 割り当て問題
  • 7.5.3. ネットワークフロー
  • 7.5.4. 最適部分木
  • 7.5.5. 最適マッチング
  • 7.5.6. 最適順序付け
  • 7.6. 独立性理論
  • 7.6.1. 独立構造
  • 7.6.2. 効率的なマトロイドアルゴリズム
  • 7.7. 離散動的計画法
  • 7.8. ブランチアンドバウンド技術
  • 7.9. ヘラクレス的なタスク(別名NP困難問題)
  • 7.10. 近似最適化
    1. 再帰
ペーパーバック・ファスシクル

第4巻の新しい素材は、約128ページのベータテスト形式のファスシクルとして、年に約2回発行されます。これらのファスシクルは、私の包括的な説明の最善の試みとなりますが、コンピュータサイエンスは、私がこれらの書籍で扱われるすべての素材の権威であるとは期待できないほど成長しました。したがって、公式ボリュームを後で準備するために読者からのフィードバックが必要になります。

例えば、以下のファスシクルが第4A巻と第4B巻のハードカバー版が完成する前に発行されました。

Volume 4 Fascicle 0, Introduction to Combinatorial Algorithms and Boolean Functions (2008), xii+216pp. ISBN 0-321-53496-4
Volume 4 Fascicle 1, Bitwise Tricks & Techniques; Binary Decision Diagrams (2009), xiii+261pp. ISBN 0-321-58050-8
Volume 4 Fascicle 2, Generating All Tuples and Permutations (2005), v+128pp. ISBN 0-201-85393-0
Volume 4 Fascicle 3, Generating All Combinations and Partitions (2005), vi+150pp. ISBN 0-201-85394-9
Volume 4 Fascicle 4, Generating All Trees; History of Combinatorial Generation (2006), vi+120pp. ISBN 0-321-33570-8
Volume 4 Fascicle 5, Mathematical Preliminaries Redux; Introduction to Backtracking; Dancing Links (2019), xiii+384pp. ISBN 978-0-13-467179-6
Volume 4 Fascicle 6, Satisfiability (2015), xiii+310pp. ISBN 978-0-13-439760-3

それらのファスシクルの翻訳:
Japanese translation of Volume 4 Fascicle 0 by Eiiti Wada (Tokyo: ASCII Media Works, 2009), xii+206pp.
Chinese translation of Volume 4 Fascicle 0, under the direction of Lin Peng Huang (Beijing: Chinese Machine Press, 2010), xii+432pp.
Hungarian translation of Volume 4 Fascicle 0, under the direction of Antal Iványi: Bevezetés a kombinatorikai algoritmusokhoz és a Boole-függvényekhez (Budapest: AnTonCom Infokommunikációs Kft., 2009), in preparation.
Albanian translation of Volume 4 Fascicle 0 by Ana Ktona, Besmira Nushi, and Silvana Greca, Arti i programimit kompjuterik, V. 4, Fashikulli 0, Hyrje ne algoritmat me Kombinatoralë dhe funksionet Boolean (Bitola: Mikena, 2009), 238pp.
Hungarian translation of Volume 4 Fascicle 1, under the direction of Antal Iványi: Bitenkénti trükkök és módszerek; Bináris döntési diagramok (Budapest: AnTonCom Infokommunikációs Kft., 2009), in preparation.
Japanese translation of Volume 4 Fascicle 1 by Eiiti Wada (Tokyo: ASCII Media Works, 2011), x+256pp.
Romanian translation of Volume 4 Fascicle 2, by Cora Radulian: Generarea tuturor tuplurilor și permutărilor (Bucharest: Editura Teora, 2005), vii+144pp.
Japanese translation of Volume 4 Fascicle 2 by Hiroshi Koide, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Media Works, 2006), viii+129pp.
Russian translation of Volume 4 Fascicle 2, by Yu. G. Gordienko: Generatsiia vsekh kortezheĭ i perestanovok (Moscow: Vil'iams, 2007), 146pp.
Polish translation of Volume 4 Fascicle 2, by Adam Malinowski: Generowanie wszystkich krotek i permutacji (Warsaw: Wydawnictwa Naukowo-Techniczne, 2007), xiv+137pp.
Hungarian translation of Volume 4 Fascicle 2, under the direction of Antal Iványi: Permutációk és n
-esek előállítása (Budapest: AnTonCom Infokommunikációs Kft., 2008), 160pp.
Russian translation of Volume 4 Fascicle 3, by I. V. Krasikov: Generatsiia vsekh sochetaniĭ i razbieniĭ (Moscow: Vil'iams, 2007), 200pp.
Japanese translation of Volume 4 Fascicle 3 by Kazuhiko Kakehi, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Media Works, 2008), viii+154pp.
Hungarian translation of Volume 4 Fascicle 3, under the direction of Antal Iványi: Kombinációk és partíciók előállítása (Budapest: AnTonCom Infokommunikációs Kft., 2008), 176pp.
Russian translation of Volume 4 Fascicle 4, by I. V. Krasikov: Generatsiia vsekh derev'ev. Istoriia kombinatornĭ generatsiĭ (Moscow: Vil'iams, 2007), 156pp.
Hungarian translation of Volume 4 Fascicle 4, under the direction of Antal Iványi: Fák előállítása; Kombinatorikus előállítások története (Budapest: AnTonCom Infokommunikációs Kft., 2008), 160pp.
Japanese translation of Volume 4 Fascicle 4 by Kazuhiko Kakehi and Hiroshi Koide, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Media Works, 2010), viii+118pp.

The future Volume 4C is currently represented by
Volume 4 Fascicle 7, Constraint Satisfaction (2025), xiv+281pp. ISBN 978-0-13-532824-8
Some "pre-fascicles" are also available for alpha-testing: Pre-Fascicle 8a (Hamiltonian Paths and Cycles); Pre-Fascicle 9b (A Potpourri of Puzzles). I've put them online primarily so that experts in the field can check the contents before I inflict them on a wider audience. But if you want to help debug them, please go right ahead.

第5巻

Syntactic Algorithms, in preparation.

    1. 字句解析(文字列検索とデータ圧縮も含む)
    1. パーシング技術
今後の計画

第4巻と第5巻の執筆を続けるにあたり、第1巻〜第3巻に論理的に属するが、私がそれらの書籍を書いた時点ではまだ発明されていなかったトピックを参照する必要があります。そのような素材を第4巻または第5巻に人工的に含めるのではなく、ファスシクル形式で含めます。最初のそのようなファスシクルはすでに完成しています(上記参照)。それは第4A巻で使用されるRISCマシンであるMMIXを説明しています。MMIXは、第1巻、第2巻、第3巻のすべての後続エディションでMIXに取って代わります。

Volume 1 Fascicle 1 の 2004年2月16日版をダウンロード (圧縮PostScript 583KB) (ただし、この古いバージョンは現在メンテナンスされていません。以下の正誤表を参照してください)

第5巻が完成した後、第1巻〜第3巻を再度改訂して最新の状態にします。特に、ベータテストファスシクルとして発行されたこれらの巻の新しい素材は、その時点で組み込まれます。

その後、第1巻〜第5巻の「リーダーズダイジェスト」版を出版し、最も重要な素材を1冊に凝縮します。

そして、第1巻〜第5巻が完成した後、神のご加護があれば、第6巻(文脈自由言語の理論)と第7巻(コンパイラ技術)を出版する予定ですが、それは私がそれらのトピックについて言いたいことがまだ関連性があり、まだ言われていない場合に限ります。第1巻〜第5巻は、シーケンシャルマシンにおけるコンピュータプログラミングの中心的な核を表しており、第6巻と第7巻の主題は重要ですが、より専門的です。

[[画像]]

第1巻〜第4B巻は出版社であるAddison-Wesley Publishing Companyから入手できます。

MIXware

MIXコンピュータはまもなくMMIXと呼ばれるRISCマシンに置き換えられます。MMIX。それまでの間、オリジナルの60年代のマシン用の既存のプログラムを試したい場合は、以下のサイトで適切なソフトウェアが見つかるかもしれません。

(Please let me know of any other sites that I should add to this list.)

The MMIX Supplement

[[画像]]

Martin Ruckert has written an excellent 200-page companion to Volumes 1, 2, and 3, intelligently translating all of the MIX programs into MMIX form. This booklet is jam-packed with instructive details and opportunities for self-instruction.

Errata et Addenda for Volume 1

The main changes between the second and third editions of Volume 1 are listed in the Errata for Volume 1 (2nd ed.) (335K bytes of compressed PostScript, 80pp)---an archival file that is not being kept up to date. But thousands of additional refinements appear in the 3rd edition; you really should ask someone to get it for you next Christmas.

The main changes to the third edition of Volume 1, made before the appearance of Volume 4A in 2011, are listed in the Earliest errata for Volume 1 (3rd ed.) (262K bytes of compressed PostScript, 50pp).

There's also another major list of changes, covering the period 2011--2021: Earlier changes for Volume 1 (3rd ed.) (143K bytes of compressed PostScript, 20pp).

There's also a (much shorter, last updated 31 May 2026) list of changes since the 49th printing was released in 2022, almost all of which have been made in more recent printings:

Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.

And there's also a list of changes to Volume 1 Fascicle 1, last updated 08 January 2025:

Note: An unknown number of badly printed copies of Volume 1 Fascicle 1 were printed by mistake. Among other defects, the copyright page has incredibly poor resolution, and the MMIX summary chart has been omitted from the inside back cover. If you have purchased one of these monstrosities, the publishers assure me that they will replace your copy with a good one.

Errata et Addenda for Volume 2

The main changes between the second and third editions of Volume 2 are listed in the Errata for Volume 2 (2nd ed.) (555K bytes of compressed PostScript, 142pp)---an archival file that is not being kept up to date. But thousands of additional refinements appear in the 3rd edition; you really should ask someone to get it for you next Christmas.

The main changes to the third edition of Volume 2, made before the appearance of Volume 4A, are listed in the Earliest errata for Volume 2 (3rd ed.) (229K bytes of compressed PostScript, 50pp), dated 08 January 2011.

There's also another major list of changes, covering the period 2011--2021: Earlier changes for Volume 2 (3rd ed.) (133K bytes of compressed PostScript, 19pp).

There's also a (much shorter, last updated 09 June 2026) list of changes since the 45th printing was released in 2022, almost all of which have been made in more recent printings:

Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.

Errata et Addenda for Volume 3

The main changes between the first and second editions of Volume 3 are listed in the Errata for Volume 3 (1st ed.) (430K bytes of compressed PostScript, 109pp)---an archival file that is not being kept up to date. But thousands of additional refinements appear in the 2nd edition; you really should ask someone to get it for you next Christmas.

The main changes to the second edition of Volume 3, made before the appearance of Volume 4A in 2011, are listed in the Earliest errata for Volume 3 (2nd ed.) (226K bytes of compressed PostScript, 43pp).

There's also another major list of changes, covering the period 2011--2021: Earlier changes for Volume 3 (2nd ed.) (117K bytes of compressed PostScript, 15pp).

There's also a (much shorter, last updated 09 June 2026) list of changes since the 45th printing was released in 2022, almost all of which have been made in more recent printings:

Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.

Errata et Addenda for Volume 4A

The following corrections to the paperback fascicles that preceded Volume 4A will make them essentially consistent with the first hardcover printing of that volume. (These errata files reached their final form on 01 January 2011, and they won't be updated again; see below for additional amendments and corrections to the hardcover printing.)

The main changes to the first edition of Volume 4A, made before the appearance of Volume 4B in 2022, are listed in the Earliest errata for Volume 4A (225K bytes of compressed PostScript, 44pp).

There's also a (much shorter, last updated 09 September 2025) list of changes since the 20th printing was released in 2022, almost all of which have been made in more recent printings:

Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.

Errata et Addenda for Volume 4B

The following corrections to the paperback fascicles that preceded Volume 4B will make them essentially consistent with the first hardcover printing of that volume. (These errata files reached their final form on 26 July 2022, and they won't be updated again; see below for additional amendments and corrections to the hardcover printing.)

And there's also a list of changes to Volume 4 Fascicle 6:

Here's the current list of changes to the hardcover edition of Volume 4B, last updated 16 April 2026:

Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.

Errata et Addenda for Volume 4C

Volume 4C is just getting started, as stated above. So far at least its first couple hundred pages are available as Volume 4 Fascicle 7. Here are the corrections that I've made so far to my master copy of that fascicle (last updated 15 October 2026):

Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.

Rewards

The first finder of any error in my books receives 0x$1.00 ($2.56), deposited to their account at the Bank of San Serriffe; significant suggestions are also worth 0x$0.20 ($0.32) each. If you are a really careful reader, you may be able to recoup more than the cost of the books this way, and you'll be helping future readers too.

However, people who have read the book Eats, Shoots & Leaves should not expect a reward for criticizing the ways in which I use commas. Punctuation is extremely important to me, but I insist on doing it my own way.

Similarly, you can save yourself valuable time by not trying to get me to change ‘awhile’ to ‘a while’.

As mentioned above, I take no responsibility for errors in the eBook editions that do not use PDF format. I would soon go broke if I had to pay for all of them! Such errors should be reported directly to the publisher, not to me, and you should request a replacement copy.

Please send your comments either by email to taocp@cs.stanford.edu or by old-fashioned mail to

Donald E. Knuth
Computer Science Department
CoDa Building room W208
389 Jane Stanford Way
Stanford University
Stanford, CA 94305-5008 USA.

In either case please include your postal address, so that I can mail an official certificate of deposit as a token of thanks for any improvements to which you have contributed.

SPECIAL NOTE TO THE SPEAKERS OF FRENCH AND OTHER EXOTIC LANGUAGES: Numerous quotations and bibliographic citations found in these books have been copied verbatim from the original sources. If you believe you have found a typographic error, you must prove it by showing that the original was incorrectly transcribed; believe it or not, your language has changed over the years, just as English has.

Although I'm working full time on Volume 4C these days, I will try to reply to all such messages within nine months of receipt.

BUT PLEASE DO NOT SEND EMAIL TO TAOCP EXCEPT TO REPORT ERRORS IN THE ART OF COMPUTER PROGRAMMING. And if you do report an error via email, please do not include attachments of any kind; your message should be readable on brand-X operating systems for all values of X. (Encrypted messages that I get from "gmail.com" are also gibberish and unreadable without great pain.) Send PLAIN ASCII TEXT ONLY.

[[画像]]

[画像]Don Knuth's home page
[画像]Don Knuth's other books

[画像: Valid HTML 4.01 Transitional] [画像]