Stack Overflow
Stack Overflow

Questions tagged [taocp]

The Art of Computer Programming (acronym: TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.

Wikipedia -

The Art of Computer Programming (acronym: TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.

Knuth began the project, originally conceived as a single book with twelve chapters, in 1962. The first three of what were then expected to be seven volumes were published in rapid succession in 1968, 1969, and 1973. The first installment of Volume 4 (a paperback fascicle) was published in 2005. The hardback volume 4A was published in 2010. Additional fascicle installments are planned for release approximately biannually.

37 questions
0
votes
1 answer

What is the behaviour of STA (0:1) in MIX?

In MIX STA stores the contents of the A register in a given memory location. I can't see how the behaviour around the sign is covered in TAOCP. How does MIX behave in the following example: Location 2000 contains: + 5 4 6 2 1 The A register…
Shillington
  • 127
  • 1
  • 9
0
votes
1 answer

What is a "gigamem"?

I am reading Donald Knuth's TAOCP: volume 4, Fascicle 6, p18. He mentions the word gigamem. What does he mean? What is a gigamem?
conor
  • 1,131
  • 1
  • 15
  • 20
0
votes
2 answers

How does division work in MIXAL assembly?

I am trying to perform a simple integer division (9/2=?) but MIX builder throws Integer overflow error. Am I doing something wrong? Here is the code: ORIG 1000 START NOP A CON 0 B CON 0 ENTA 2 STA A ENTX 9 DIV A STA A HLT END START
Algoprog
  • 21
  • 1
  • 5
0
votes
0 answers

How can we obtain the same number by taking Roman Numerals?

On page 2 of The Art of Computer Programming, Volume 1, Fascicle 1, Knuth (2005) writes, "The same number may also be obtained in a simpler way by taking Roman Numerals." This is part of Knuth's humorous explanation of the identifying number of the…
Shaun Luttin
  • 133,272
  • 81
  • 405
  • 467
0
votes
1 answer

The Art of Computer Programming (2nd ed.): Mathematical Induction

In 1.2.1 Mathematical Induction section, Knuth presents mathematical induction as a two steps process to prove that P(n) is true for all positive integers n: a) Give a proof that P(1) is true; b) Give a proof that "if all P(1), P(2),..., P(n) are…
Korchkidu
  • 4,908
  • 8
  • 49
  • 69
-1
votes
1 answer

How do I extract an algorithm from these instructions?

I've been reading through The Art of Computer Programming, and though it has its moments of higher maths that I just can't get, some exercises have been fun to do. After I've done one of them I go over to the answer, see if I did better or worse…
RiggedDeath
  • 21
  • 2
-1
votes
1 answer

Looking for Algorithm Source

Looking through my 3 volumes of TAOCP I can not find the source of the short random sequence: // Seed always in 1..0x10000 Seed = (Seed * const) % 0x10001 There was also a algorithm and possibly a MIX program to validate the const such that all…
user3029680
  • 35
  • 1
  • 5
1 2
3