Not enough data to create a plot.
Try a different view from the menu above.
The Chess Machine: An Example of Dealing with a Complex Task by Adaptation
"The modern general-purpose computer can be characterized as the embodiment of a three-point philosophy: (1) There shall exist a way of computing anything computable; (2) The computer shall be so fast that it does not matter how complicated the way is; and (3) Man shall be so intelligent that he will be able to discern the way and instruct the computer." Proceedings of the 1955 Western Joint Computer Conference, Institute of Radio Engineers, New York, pp 101-108, 1955. (Also issued as RAND Technical Report P-620.)
Systems of syntactic analysis
The Journal of Symbolic Logic (JSL) was founded in 1936 and it has become the leading research journal in the field. Volume 71, being published during 2006, will consist of approximately 1300 pages. The Journal is distributed with The Bulletin of Symbolic Logic. The Journal and The Bulletin are the official organs of the Association for Symbolic Logic, an international organization for supporting research in symbolic logic and furthering the exchange of ideas among mathematicians, philosophers, computer scientists, linguists, and others interested in this field. The main purpose of The Journal is to publish original scholarly work in symbolic logic.
Semantic information
Current issues are now on the Chicago Journals website. Read the latest issue.Since 1950, The British Journal for the Philosophy of Science (BJPS) has presented the best new work in the discipline. Published on behalf of the British Society for the Philosophy of Science, the journal offers innovative and thought-provoking papers that open up new areas of inquiry or shed new light on well-known issues.
Digital computers applied to games
Turing, A. | Strachey, C. | Bates, M. A. | Bowden, B. V.
Most people enjoy playing games. Most CS-1 students will enjoy a final project that involves computational game-playing. Chance-It is a simple two-person dice game with many possible strategies at varying levels of sophistication and complexity. These features make the problem of formalizing and encoding a strategy to play Chance-It an interesting final project for CS-1.This paper describes an object-oriented final project for CS-1 in which students build Player1 and Player2 classes to play Chance-It. A ChanceItGame class and driver are provided to coordinate the interactions of these classes.
On the theory of dynamic programming
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review. Our mission to help improve policy and decisionmaking through research and analysis is enabled through our core values of quality and objectivity and our unwavering commitment to the highest level of integrity and ethical behavior. To help ensure our research and analysis are rigorous, objective, and nonpartisan, we subject our research publications to a robust and exacting quality-assurance process; avoid both the appearance and reality of financial and other conflicts of interest through staff training, project screening, and a policy of mandatory disclosure; and pursue transparency in our research engagements through our commitment to the open publication of our research findings and recommendations, disclosure of the source of funding of published research, and policies to ensure intellectual independence.
Mechanical Chess Player
I don't say "beat" its designer; I say Let us assume that the machine cannot analyze the position right out and that it must make judgments. The problem, then, becomes that the machine must form its own criteria for judgment, and, if it is to beat its designer, it must form better judgments than the designer can put into it. Can we build such a machine? The problem that faces the designer is the same as that of the father who is not a good chess player and who wants his son to become world champion. Obviously, he must be very careful about what he teaches the boy.