![]() |
CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Ockham's razor, empirical complexity, and truth-finding efficiencyby: Kevin T. Kelly
Theoretical Computer Science In Complexity of Algorithms and Computations, Vol. 383, No. 2-3. (18 September 2007), pp. 270-289.
|
This article has been bookmarked 4 times, initially on 2007-08-28.
| 2008-05-07 | User mdreid , 1 note |
2008-05-07 00:20:27
| |
| Group Statistical Machine Learning , 1 note | |
2008-05-07 00:20:27
| |
| 2008-04-08 | User BrianTomasik |
| 2007-08-28 | User kazuyah |