Investigations in the Theory of Descriptive Complexity (Classic Reprint) - Tapa dura

Sinopsis

Excerpt from Investigations in the Theory of Descriptive Complexity

In terms of each of the three above approaches a random or patternless string 5 is defined as one whose shortest program is of length essentially equal to it self. Intuitively, if a string contains some pattern then that pattern can be exploited by the computer in outputting the string. However, if a string 5 is genuinely patternless the shortest program for outputting it might consist of inputting s and instructing the computer to output its input.

Chapter 1. Will present most of the fundamental notations, definitions and results developed for the most part by others which are relevant to our work.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sinopsis" puede pertenecer a otra edición de este libro.