Re: Re: What are useful for a phd?

From: Hector Zenil (
Date: Tue Dec 05 2006 - 14:43:01 MST

The complexity theory you are referring to is called "computability theory".


Hector Zenil

On 12/5/06, Philip Goetz <> wrote:
> Things in a computer science program not relevant to AI:
> Learning how to program in twelve different computer languages
> Compiler theory
> Operating systems theory
> Computer architecture
> Complexity theory, other than knowing the diff between O(nlogn) and O(n*n)
> (here I'm using "complexity theory" to refer to i.e. understanding
> the difference
> between recursive, recursively enumerable, and co-recursively-enumerable,
> not to "complexity studies" a la the Santa Fe Institute)

This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:57 MDT