Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs.
"Sinopsis" puede pertenecer a otra edición de este libro.
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 3,58 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoGRATIS gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: 2nd Life Books, Burlington, NJ, Estados Unidos de America
Condición: good. Used book in good condition. May have some wear to binding, spine, cover, and pages. Some light highlighting markings writing may be present. May have some stickers and or sticker residue present. May be Ex-lib. copy. May NOT include discs, or access code or other supplemental material. We ship Monday-Saturday and respond to inquiries within 24 hours. Nº de ref. del artículo: BXM.96P5
Cantidad disponible: 1 disponibles
Librería: Greener Books, London, Reino Unido
Hardcover. Condición: Used; Very Good. **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books. Nº de ref. del artículo: 4878486
Cantidad disponible: 1 disponibles
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
Hardcover. Condición: Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Nº de ref. del artículo: 0521343062-11-1
Cantidad disponible: 1 disponibles
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_403248221
Cantidad disponible: 1 disponibles
Librería: Orrin Schwab Books, Providence, UT, Estados Unidos de America
Hardcover. Condición: Very Good-. Light wear and rubbing to the spine edges and corners.; Cambridge Tracts In Theoretical Computer Science, Series Number 1; 7.25 X 0.75 X 10 inches; 192 pages. Nº de ref. del artículo: 51364
Cantidad disponible: 1 disponibles
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
Hardback. Condición: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Nº de ref. del artículo: GOR008433513
Cantidad disponible: 1 disponibles
Librería: The Book Spot, Sioux Falls, MN, Estados Unidos de America
Hardcover. Condición: New. Nº de ref. del artículo: Abebooks140169
Cantidad disponible: 1 disponibles
Librería: Toscana Books, AUSTIN, TX, Estados Unidos de America
Hardcover. Condición: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Nº de ref. del artículo: Scanned0521343062
Cantidad disponible: 1 disponibles