[FoRK] That's a bunch of Malarkey

Gregory Alan Bolcer greg at bolcer.org
Tue Jan 20 07:16:23 PST 2015

In Information Theory, don't you have to have a minimum of a N+1 bit 
axiomatic theory to prove that something in an N-bit axiomatic space is 
the simplest, least complex, or elegant (the rigid, formal definition)?

I was just poking fun at Stephen.

Supposed I created a game where I had a variable X and I assigned it the 
value 42.

42 has meaning outside of your experiment.  I don't think X should equal 

No, I said I assigned it 42, but I didn't define equals yet.  It's my 


"Those who make the rules win" -- Plato

On 1/20/2015 12:01 AM, J. Andrew Rogers wrote:
>> On Jan 19, 2015, at 10:58 AM, Gregory Alan Bolcer <greg at bolcer.org> wrote:
>> Occam's razor is a scientific principle, aka a philosophical heuristic to
>> problem solving.   Pascal's payout matrix is solved using a computation.
> Occam’s Razor is a bit more than a philosophical heuristic though it is often presented that way. It is also an expression of a general mathematical theorem, admittedly proved millennia after the existence of the heuristic. Occam’s Razor, used correctly, is not excludable in any rigorous discussion.
> _______________________________________________
> FoRK mailing list
> http://xent.com/mailman/listinfo/fork

greg at bolcer.org, http://bolcer.org, c: +1.714.928.5476

More information about the FoRK mailing list