University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Automatic complexity: a computable measure of irregularity

Automatic complexity: a computable measure of irregularity

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

SASW09 - International conference on computability, complexity and randomness

Depending on how we define it, the “complexity” of a finite word may or may not be: 1. Computable. 2. Taking concrete values (not just up to a constant additive term). 3. Hard to compute, (1) notwithstanding. 4. Robust (admitting equivalent characterizations). Automatic complexity, introduced by Shallit and Wang in 2001, has properties (1) and (2). I will discuss the current status for (3) and (4), and what else is known and unknown about automatic complexity.  

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity