New answers tagged

2

Ray Solomonoff: A formal theory of inductive inference. Part I and Part II, 1964. Complexity-based induction systems: Comparisons and convergence theorems. 1978 Kolmogorov: Three Approaches to the Quantitative Definition of Information. 1965 Martin-Löf: The definition of random sequences. 1966 Marvin Minsky said: The most important discovery since G&...


1

I will suggest the following books. The Golden Ticket: P, NP, and the Search for the Impossible by Lance Fortnow. The book is written for all kind of readers and doesn't require you to know anything about Theoretical Computer Science. It shows the disney world where P=NP. The Nature of Computation by Cristopher Moore and Stephen Mertens. Deep ideas of ...


1

Expanders are special graph which are sparse yet highly connected. The challenge is to give an explicit construction of expanders. See the survey by Hoory-Linial-Wigderson-Expander Graphs and their Application for several applications of expanders. The most useful expanders are the ones with constant degree.If we have constant-sized object then we can freely ...


Top 50 recent answers are included