4,79 €
Patterns within Pattern-less Sequences
Patterns within Pattern-less Sequences
  • Sold out
Patterns within Pattern-less Sequences
Patterns within Pattern-less Sequences
El. knyga:
4,79 €
Essay from the year 2012 in the subject Physics - Other, grade: 4.00 (A), , course: Algorithmic Complexity, language: English, abstract: While Kolmogorov Complexity defines a measure of randomness as being pattern-less in a sequence of a binary string, such rubrics come into question when sub-groups are used as a measure of such patterns in a similar sequence of a binary string. This paper examines such sub-group patterns and finds questions raised about existing measures for a random binary s…
  • Publisher:
  • Year: 2012
  • Pages: 4
  • ISBN: 9783656217459
  • ISBN-10: 3656217459
  • ISBN-13: 9783656217459
  • Format: PDF
  • Language: English

Patterns within Pattern-less Sequences (e-book) (used book) | bookbook.eu

Reviews

There are no ratings.
Rate it too! All reviews

Description

Essay from the year 2012 in the subject Physics - Other, grade: 4.00 (A), , course: Algorithmic Complexity, language: English, abstract: While Kolmogorov Complexity defines a measure of randomness as being pattern-less in a sequence of a binary string, such rubrics come into question when sub-groups are used as a measure of such patterns in a similar sequence of a binary string. This paper examines such sub-group patterns and finds questions raised about existing measures for a random binary string.

4,79 €
Log in and for this item
you will receive 0,05 Book Euros! ?

Electronic book:
Delivery after ordering is instant! Intended for reading only on a computer, tablet or other electronic device.

Lowest price in 30 days: 4,79 €

Lowest price recorded: Price has not changed

  • Author: Bradley Tice
  • Publisher:
  • Year: 2012
  • Pages: 4
  • ISBN: 9783656217459
  • ISBN-10: 3656217459
  • ISBN-13: 9783656217459
  • Format: PDF
  • Language: English English

Essay from the year 2012 in the subject Physics - Other, grade: 4.00 (A), , course: Algorithmic Complexity, language: English, abstract: While Kolmogorov Complexity defines a measure of randomness as being pattern-less in a sequence of a binary string, such rubrics come into question when sub-groups are used as a measure of such patterns in a similar sequence of a binary string. This paper examines such sub-group patterns and finds questions raised about existing measures for a random binary string.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)