Chapter 11: The Notion of Computation


Section 1: Computation as a Framework

Page 637Notes

Section 2: Computations in Cellular Automata

Page 638 Page 639 Page 640 Page 641Notes

Section 3: The Phenomenon of Universality

Page 642 Page 643Notes

Section 4: A Universal Cellular Automaton

Page 644 Page 645 Page 646 Page 647 Page 648 Page 649 Page 650 Page 651 Page 652 Page 653 Page 654 Page 655Notes

Section 5: Emulating Other Systems with Cellular Automata

Page 656 Page 657 Page 658 Page 659 Page 660 Page 661 Page 662 Page 663Notes

Section 6: Emulating Cellular Automata with Other Systems

Page 664 Page 665 Page 666 Page 667 Page 668 Page 669 Page 670 Page 671 Page 672 Page 673Notes

Section 7: Implications of Universality

Page 674Notes

Section 8: The Rule 110 Cellular Automaton

Page 675 Page 676 Page 677 Page 678 Page 679 Page 680 Page 681 Page 682 Page 683 Page 684 Page 685 Page 686 Page 687 Page 688 Page 689Notes

Section 9: The Significance of Universality in Rule 110

Page 690Notes

Section 10: Class 4 Behavior and Universality

Page 691 Page 692 Page 693Notes

Section 11: The Threshold of Universality in Cellular Automata

Page 694 Page 695 Page 696 Page 697 Page 698 Page 699 Page 700 Page 701 Page 702 Page 703 Page 704 Page 705Notes

Section 12: Universality in Turing Machines and Other Systems

Page 706 Page 707 Page 708 Page 709 Page 710 Page 711 Page 712 Page 713 Page 714Notes

From Stephen Wolfram: A New Kind of Science [citation]