Thomas A. Standish – författare
Visar alla böcker från författaren Thomas A. Standish. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Chess deals with the history of computer chess games and the programming of computer chess. Topics covered include chess programs such as the one initiated by Richard Greenblatt and those launched by the United States and the USSR in 1966-1967. The United States Computer Chess Championships from 1970 to 1973 are also discussed. Comprised of 10 chapters, this book begins with a historical overview of the basic ideas underlying computer chess and several of the earliest computer games. The next chapter deals with the chess match held in 1966 pitting the Kotok-McCarthy Chess Program of the United States and the ITEP (Institute of Theoretical and Experimental Physics) Chess Program of the Soviet Union. The reader is then introduced to Greenblatt''s program, named Mac Hack Six, the first chess program to compete respectably against humans in tournament play. Subsequent chapters focus on the U.S. Computer Chess Championships, from its first edition in New York in 1970 to the fourth, held in Atlanta in 1973. Russia''s chess program called KAISSA, an improved version of the ITEP Chess Program, is also described. The final chapter is devoted to OSTRICH, a chess-playing program written by George Arnold in the Digital Computer Laboratory of Columbia University''s Department of Electrical Engineering and Computer Science in 1971. This monograph will be of value to computer science and those interested in computer chess programs and in the broader field of artificial intelligence.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
ACM Monograph Series: A Computational Logic focuses on the use of induction in proving theorems, including the use of lemmas and axioms, free variables, equalities, and generalization. The publication first elaborates on a sketch of the theory and two simple examples, a precise definition of the theory, and correctness of a tautology-checker. Topics include mechanical proofs, informal development, formal specification of the problem, well-founded relations, natural numbers, and literal atoms. The book then examines the use of type information to simplify formulas, use of axioms and lemmas as rewrite rules, and the use of definitions. Topics include nonrecursive functions, computing values, free variables in hypothesis, infinite backwards chaining, infinite looping, computing type sets, and type prescriptions. The manuscript takes a look at rewriting terms and simplifying clauses, eliminating destructors and irrelevance, using equalities, and generalization. Concerns include reasons for eliminating isolated hypotheses, precise statement of the generalization heuristic, restricting generalizations, precise use of equalities, and multiple destructors and infinite looping. The publication is a vital source of data for researchers interested in computational logic.