[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

What Machines Can and Cannot Do

Published: 01 June 1972 Publication History
First page of PDF

References

[1]
R. K. HAGEDORN. Benjamin Franklin and chess m early America. Univ. Pennsylw~nia Press, Philadelphia, Pa., 1958.
[2]
C, E. SHANNON. "Programming a digital computer for playing chess." Philosophy Magazine 41 (March 1950), 356-357.
[3]
j. R. NEWMAN (ED.). The world of mathematics. Vol. 4. Simon and Schuster, New York, 1956.
[4]
R. D. GREENBLATT; D. E. EASTLAKE; AND S. D. CROCKER. "The Greenblatt chess program." In Proc. AFIPS 1967 FJCC, Vol. 31, AFIPS Press, MontvMe, N. J., 801-810.
[5]
A. SAMUEL. "Some studies in machine learning using the game of checkers." IBM J. R & D 3, 3 (July 1954), 210- 229; and
[6]
A. SAMUEL. "Some studies in machine learning using the game of checkers. Recent progress." IBM J. R & D ll, 6 (Nov. 1967), 601-617.
[7]
A. M. TURING. "Computmg machinery and intelligence." Mz~d 9 (1950), 433- 460. and is reprinted in The world of mathematics, mentioned above (pp. 2099-2123).
[8]
A. R. ANDERSON (ED.). Minds and machines. Prentice-Hall, Inc., Englewood Cliffs, N. j., 1964.
[9]
M. MINSKY (ED.). Semantic bsformahon processing. MIT Press, Cambridge, Mass., 1968.
[10]
D. G. BorRow. "Nature language input for a computer problem-solving systern." In Semantic information processing, 135-215.
[11]
J. WEIZENBAUM. "ELIzA--a computer program for the study of natural language communication between man and machine." Comm. A CM 9, 1 (Jan. 1966), 36-45; and again later, in
[12]
J. WE~ZENBA~JM. "Contextual understanding by computers." Comm. A CM 10, 8 (Aug. 1967), 474-480.
[13]
L. A. JEFFRESS. Cerebral mechanzsms in behavzor--the Hixon symposium. John Wiley & Sons, New York, 1951, 1-41. It is also reprinted in The world of mathematics, mentioned above (pp. 2070-2098), and in
[14]
A. H. TAuB (ED.). john yon Neurnann~ collected worlds. Vol. V. Macmillan Co., New York, 1963, 288-328.
[15]
J. VON NEUMANN. Theory of self-reproducing automala. (Edited and completed by Arthur W. Burks), Univ. Illinois Press, Urbana, Ill., 1966.
[16]
A. W. BURKS (ED.). Essays on cellular automata. Univ. Illinois Press, Urbana, Ill., 1970.
[17]
M. DAvis. The undecidable. Raven Press, Hewleft, New York, 1965.
[18]
M. MINSKY. Computation: finite and infinite machines. Prentice-Hall, Inc., Englewood Cliffs, N. j., 1967.
[19]
H. I:~.OGERS. Theory of recursive funclzons and effective computability. McGraw Hill Book Co., New York, 1967.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Computing Surveys
ACM Computing Surveys  Volume 4, Issue 2
June 1972
82 pages
ISSN:0360-0300
EISSN:1557-7341
DOI:10.1145/356599
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1972
Published in CSUR Volume 4, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)37
  • Downloads (Last 6 weeks)6
Reflects downloads up to 02 Mar 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media