Investigations in the Theory of Descriptive Complexity (Classic Reprint) - Couverture souple

Gewirtz, William L.

9781332145317: Investigations in the Theory of Descriptive Complexity (Classic Reprint)

Couverture souple

ISBN 10 : 1332145310 ISBN 13 : 9781332145317

Editeur : Forgotten Books, 2019

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 15,10

3 Neuf

De EUR 15,71

D�tails de l'�dition

�diteur: Forgotten Books
Date d'�dition: 2019
Langue: anglais
ISBN 10: 1332145310
ISBN 13: 9781332145317
Reliure: Broch�
Nombre de pages: 70
Coordonn�es du fabricant: FB &c Ltd
info@forgottenbooks.org

Dalton House
60 Windsor Avenue
London
SW19 2RR
Royaume-Uni
Personne responsable: Buchpark GmbH
gpsr@buchpark.de

Kr�gerweg 1
Trebbin
Brandenburg
14959
Allemagne

Acheter D'occasion

Zustand: Hervorragend | Sprache...

Afficher cet article

EUR 15,10

Autre devise

EUR 105 exp�dition depuis Allemagne vers Etats-Unis

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 15,71

Autre devise

Gratuit exp�dition depuis Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9781342031457: Investigations in the Theory of Descriptive Complexity

Edition pr�sent�e

ISBN 10 : 1342031458 ISBN 13 : 9781342031457
Editeur : Palala Press, 2015
Couverture rigide

R�sultats de recherche pour Investigations in the Theory of Descriptive Complexity...

Image fournie par le vendeur

Investigations in the Theory of Descriptive Complexity (Classic Reprint)

William L. Gewirtz

Edit� par Forgotten Books, 2018

ISBN 10 : 1332145310 ISBN 13 : 9781332145317

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : 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. N� de r�f. du vendeur 9781332145317_0

Contacter le vendeur