Complexity Flashcards

1
Q

What is algorithmic complexity

A

The shortest computer program required to generate a sequence, such as DNA.
ACGTACGTACGTACGT- Shorter
TCGAGCTAG- longer
1st one can use the fact that it is repeated to generate a shorter algorithm.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is logical depth

A

despite algorithmic equality, the amount of steps that is takes to complete.
All combinations of 3
all combinations of 4.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is crypticity

A

How DIFFICULT it is to generate the shortest computer program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Dimensions

A
  • Fractals are generated from simple recursive algorithms
  • Self similar at all scales,
  • infinite surface area
  • orgin of power laws
    some things dont fit into an integer dimension- fractals.
    Fractals can satisfy power laws, this is seen in the real world, the times between earthquakes, metabolic scaling tyheory, mandelbrots.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Ways to define complexity

A

Algorithmic, logical depth, crypticity, dimensions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly