Posted on June 14, 2008 by Peter Turney
Ockham’s razor is the principle that entities must not be multiplied beyond necessity. There are many different interpretations of Ockham’s razor. For me, the idea that simplicity is a guide to truth is the core of Ockham’s razor.
For any set of observations, there are an infinite number of theories that can fit the observations, with [...]
Filed under: Computer Science, Philosophy of Mind, Philosophy of Science | Tagged: complexity, induction, inductive inference, Ockham's Razor, simplicity, stability | 17 Comments »
Posted on May 24, 2008 by Peter Turney
I believe that math is very important: My first paper was mathematical (How many ways can an N-dimensional hypercube be unfolded into (N-1)-dimensional space?) and my most recent paper was mathematical (How can a very large tensor be decomposed with limited RAM?). But medan agan: everything in moderation; nothing in excess. In machine learning and [...]
Filed under: Computer Science, Philosophy of Mind, Philosophy of Science | Tagged: AI, complexity, math, moderation | 7 Comments »