Items related to Investigations in the Theory of Descriptive Complexity...
Synopsis
This book explores the fascinating concept of 'descriptive complexity' in computer science. The author presents various formulations of the notion of descriptive complexity, seeking to define and measure the randomness of infinite binary strings. The book considers how the complexity of a program might change when given more information about the object it operates on, such as its length. A key question is whether there exist truly random sequences or if all sequences can be described using some finite program. This question is explored through a 'subrecursive formulation' which places restrictions on the functions which can be computed. The author ultimately concludes that truly random sequences do exist and that they cannot be described using any finite program. This book will appeal to computer scientists, mathematicians, and anyone interested in the foundations of computing and information theory. Its insights into the nature of randomness and complexity provide valuable contributions to our understanding of these fundamental concepts.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.77
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Investigations in the Theory of Descriptive Complexity...
Seller Image
Investigations in the Theory of Descriptive Complexity (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book explores the fascinating concept of 'descriptive complexity' in computer science. The author presents various formulations of the notion of descriptive complexity, seeking to define and measure the randomness of infinite binary strings. The book considers how the complexity of a program might change when given more information about the object it operates on, such as its length. A key question is whether there exist truly random sequences or if all sequences can be described using some finite program. This question is explored through a 'subrecursive formulation' which places restrictions on the functions which can be computed. The author ultimately concludes that truly random sequences do exist and that they cannot be described using any finite program. This book will appeal to computer scientists, mathematicians, and anyone interested in the foundations of computing and information theory. Its insights into the nature of randomness and complexity provide valuable contributions to our understanding of these fundamental concepts. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332145317_0
Quantity: Over 20 available
Stock Image
Investigations in the Theory of Descriptive Complexity Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332145317
Quantity: 15 available
Stock Image
Investigations in the Theory of Descriptive Complexity Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332145317
Quantity: 15 available
Stock Image
Investigations in the Theory of Descriptive Complexity (Classic Reprint)
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 26060872/1
Quantity: 1 available