Re: Combined response Re: Computing Randomness

2001-05-01 Thread Hal Ruhl
Dear Bruno: Thank you for your patience and the excellent response. >You should try to make your model part of established mathematics. >Not for the glory, but for making it comprehensible. That is what I am trying to do here, but since I have proven to have too few current mathematical skills

Re: Combined response Re: Computing Randomness

2001-05-01 Thread Marchal
Hal Ruhl wrote: >I appreciate the conversation so I will try to build a common reference so >each additional step to my model can be built on that base and individually >commented on. As requested these are definitions and terms relevant to my >model not necessarily to established mathemati

Re: Combined response Re: Computing Randomness

2001-05-01 Thread Marchal
Hal Ruhl wrote: >I appreciate the conversation so I will try to build a common reference so >each additional step to my model can be built on that base and individually >commented on. As requested these are definitions and terms relevant to my >model not necessarily to established mathematic

Re: Combined response Re: Computing Randomness

2001-04-26 Thread Hal Ruhl
Dear Bruno: I appreciate the conversation so I will try to build a common reference so each additional step to my model can be built on that base and individually commented on. As requested these are definitions and terms relevant to my model not necessarily to established mathematics. 1a)

Re: Combined response Re: Computing Randomness

2001-04-26 Thread Marchal
Hal wrote: >That seems to be mostly what I said. Each cascade is a self contained >FAS. Until now I was believing that a cascade was a sort of proof. How could a cascade be a FAS? And what do you mean by self contained FAS ? >Each is a one trick pony. Are you attempting to get the pri

Re: Combined response Re: Computing Randomness

2001-04-25 Thread Hal Ruhl
Dear Bruno: At , you wrote: >Hal Ruhl wrote: > > >The assumption leads to a contradiction when "String N" exceeds the > >complexity allowed by Chaitin. More information must be added to the > >cascade for it to continue. > >Why ? Only if your FAS produces as output just the "string N" >and then

Re: Combined response Re: Computing Randomness

2001-04-25 Thread Marchal
Hal Ruhl wrote: >The assumption leads to a contradiction when "String N" exceeds the >complexity allowed by Chaitin. More information must be added to the >cascade for it to continue. Why ? Only if your FAS produces as output just the "string N" and then stop, then there would indeed be a co

Combined response Re: Computing Randomness

2001-04-24 Thread Hal Ruhl
Dear Juergen and Bruno: Clearly I have a problem when I try to use mathematical terminology in which I am not formally trained to explain my approach. So here is an attempt to explain it in just a few normal words. My "system" be it a FAS or not is modeled on the logistics equation process n