References
| [Bac08] | Roland Backhouse. The capacity-C torch problem. In Philippe Audebaud and Christine Paulin-Mohring (eds), Mathematics of Program Construction, 9th International Conference, MPC2008, Marseille, France, Lecture Notes in Computer Science 5133, pp. 57–78. Springer, 2008. |
| [BCaF10] | Roland Backhouse, Wei Chen, and João Ferreira. The algorithmics of solitaire-like games. In Claude Bolduc, Jules Desharnais, and Béchir Ktari (eds), Proceedings of 10th International Conference on Mathematics of Program Construction, Lecture Notes in Computer Science 6120, pp. 1–18. Springer, 2010. |
| [BCG82] | Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy. Winning Ways, vols I and II. Academic Press, 1982. |
| [BF01] | Roland Backhouse and Maarten Fokkinga. The associativity of equivalence and the Towers of Hanoi problem. Information Processing Letters, 77: 71–76, 2001. |
| [BL80] | P. Buneman and L. Levy. The Towers of Hanoi problem. Information Processing Letters, 10: 243–244, 1980. |
| [Dij76] | Edsger W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976. |
| [Dij90] | Edsger W. Dijkstra. EWD1083: The balance and the coins. http://www.cs.utexas.edu/users/EWD/ewd10xx/EWD1083.PDF, September 1990. |
| [Dij92] | Edsger W. Dijkstra. EWD1135: The knight’s tour. http://www.cs.utexas.edu/users/EWD/ewd11xx/EWD1131.PDF, September 1992. |
| [Dij97] | Edsger W. Dijkstra. EWD1260: The marked coins and the scale. http://www.cs.utexas.edu/users/EWD/ewd12xx/EWD1260.PDF, March 1997. |
| [DS90] | Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, 1990. |
| [DW00] | John P. D’Angelo and Douglas B. West. Mathematical Thinking. Problem-Solving and Proofs. Prentice Hall, 2000. |
| [Fer10] | João Ferreira. Principles of algorithmic problem solving. PhD thesis, School of Computer Science, University of Nottingham, 2010. |
| [Gar08] | Martin Gardner. Hexaflexagons, Probability Paradoxes and the Tower of Hanoi: Martin Gardner’s First Book of Mathematical Puzzles and Games. Cambridge University Press, 2008. |
| [Gri81] | David Gries. The Science of Programming. Springer, 1981. |
| [GS93] | David Gries and Fred B. Schneider. A Logical Approach to Discrete Math. Springer, 1993. |
| [Lei69] | Gottfried Wilhelm Leibniz. Philosophical Papers and Letters, A Selection Translated and Edited, with an Introduction by Leroy E. Loemker, chapter A Study in the Logical Calculus, pages 371–382. D.Reidel Publishing Company, Dordrecht-Holland, 1969. |
| [Hon97] | Ross Honsberger. In Pólya’s Footsteps: Miscellaneous Problems and Essays, Dolciani Mathematical Expositions 19. Mathematical Association of America, October 1997. |
| [Knu68] | Donald E. Knuth. The Art of Computer Programming, Vol. I: Fundamental Algorithms. Addison-Wesley, 1968. |
| [Knu69] | Donald E. Knuth. The Art of Computer Programming, Vol. II: Seminumerical Algorithms. Addison-Wesley, 1969. |
| [Lev03] | Anany Levitin. Introduction to The Design and Analysis of Algorithms. Addison-Wesley, 2003. |
| [MM08] | Zbigniew Michalewicz and Matthew Michalewicz. Puzzle-Based Learning: An Introduction to Critical Thinking, Mathematics and Problem-Solving. Hybrid Publishers, 2008. |
| [Rot02] | Günter Rote. Crossing the bridge at night. Bulletin of the European Association for Theoretical Computer Science, 78: 241–246, 2002. |
| [Smu78] | Raymond Smullyan. What Is the Name of This Book? Prentice Hall, 1978. |
| [Ste97] | Ian Stewart. The Magical Maze. Weidenfield and Nicolson, 1997. |
| [Tar56] | Alfred Tarski. Logic, Semantics, Metamathematics: Papers from 1923 to 1938, translated by J. H. Woodger. Oxford University Press, 1956. |
| [vG90] | A. J. M. van Gasteren. On the Shape of Mathematical Arguments, Lecture Notes in Computer Science 445. Springer, 1990. |
| [Wil87] | J. G. Wiltink. A deficiency of natural deduction. Information Processing Letters, 25: 233–234, 1987. |
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.