Advertisement

Computer science for teachers: A quest for classics, and how to present them

  • Jurg Nievergelt
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 438)

Keywords

Game State Turing Test Universal Turing Machine Computer Chess Hide Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [D 89]
    A.K. Dewdney: The Turing Omnibus, Computer Science Press, 1989.Google Scholar
  2. [KCN 90]
    A. Kierulf, K.H. Chen, J. Nievergelt: Smart Game Board and Go Explorer: A study in software and knowledge engineering. Comm. ACM, Vol 33, No2, 152–166, Feb 1990.CrossRefGoogle Scholar
  3. [M 87]
    T. A. Marsland: Computer chess methods, 159–171 in Encyclopedia of AI (ed. Shapiro), Wiley 1987.Google Scholar
  4. [M 67]
    M. Minsky, Computation — Finite and infinite machines, Prentice-Hall 1967.Google Scholar
  5. [NF 90]
    R. Niederer, K. Frey: Informatik und Computernutzung im schweizerischen Bildungswesen, ETH Zurich, 1990.Google Scholar
  6. [NFR 74]
    J. Nievergelt, J.C. Farrar and E.M. Reingold: Computer Approaches to Mathematical Problems. Prentice-Hall 1974.Google Scholar
  7. [N 75]
    J. Nievergelt, Interactive systems for education — The new look of CAI. Invited paper, Proc. IFIP Conf. on Computers in Education, 465–472, North Holland 1975.Google Scholar
  8. [NVH 86]
    J. Nievergelt, A. Ventura and H. Hinterberger: Interactive Computer Programs for Education — Philosophy, Techniques, and Examples. Addison-Wesley 1986.Google Scholar
  9. [N 80]
    J. Nievergelt, Small programs for small machines. In Microcomputers in Secondary Education (E.D. Tagg, ed), 139–145, North Holland 1980.Google Scholar
  10. [Sh 50]
    C.E. Shannon, Programming a computer for playing chess. Philosophical Magazine 41, 314, 256–275, 1950.Google Scholar
  11. [T 50]
    A. M. Turing, Computing machinery and intelligence, Mind, 9, 433–460, 1950.Google Scholar
  12. [T 53]
    A.M. Turing: Digital computers applied to games. In ‘Faster than Thought: A Symposium on Digital Computing Machines', (B. V. Bowden, ed.), Ch. 25, 286–310, Pitman, London, 1953.Google Scholar
  13. [vN 28]
    J. von Neumann, Zur Theorie der Gesellschaftsspiele, Math. Annalen 100 (1928) 295–320CrossRefGoogle Scholar
  14. [vN 66]
    J. von Neumann, Theory of Self-Reproducing Automata, (A. W. Burks, ed.), Univ. of Illinois Press 1966.Google Scholar
  15. [W 66]
    J. Weizenbaum, ELIZA — A computer program for the study of natural language communication between man and machine, Comm. ACM 9, 36–45, 1966.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Jurg Nievergelt
    • 1
  1. 1.Informatik, ETHZurich

Personalised recommendations