Description: Algorithmic Information Theory Cambridge Tracts in Theoretical Computer Science, 1by G. J. Chaitin ISBN-13: 9780521343060 ISBN-10: 0521343062 Publisher: Cambridge University Press Binding: Hardcover Publication Year: 1987 Edition: First Condition: Good minus – former library book with all usual markings and indicators • cover wear About: refer to image(s) Contents: 1) Introduction Part I. Formalisms for computation: register machines, exponential diophantine equations, & pure LISP 2) The arithmetization of register machines 3) A version of pure LISP 4) The LISP interpreter EVAL Part II. Program size, halting probabilities, randomness & metamathematics 5) Conceptual development 6) Program size 7) Randomness 8) Incompleteness 9) Conclusion Appendix A. Implementation notes Appendix B. The number of S-expressions of size N mySku 6650
Price: 29 USD
Location: Des Moines, Iowa
End Time: 2024-11-21T16:49:28.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
All returns accepted: ReturnsNotAccepted
Subject Area: Computers, Mathematics, Logic, Machine Theory, Mathematical theory of computation, LISP
Publication Name: Algorithmic Information Theory
Publisher: Cambridge University Press
Subject: Programming Languages / General, Algebra / General, Computers
Publication Year: 1987
Series: Cambridge Tracts in Theoretical Computer Science Ser.
Type: Textbook
Format: Hardcover
Language: English
Author: Gregory. J. Chaitin
Educational Level: Adult & Further Education
Level: College
Features: Volume 1 in Series
Country/Region of Manufacture: United Kingdom
Number of Pages: 175 Pages
