If there are n=1 variables and k=4 states, then the number of systen states is k^n=4^1=4 and not n^k=1^4=1. I think that Mikel's formula is quite correct.
>________________________________ > Fra: Roger Hui <rogerhui.can...@gmail.com> >Til: Programming forum <programm...@jsoftware.com> >Sendt: 8:19 onsdag den 1. maj 2013 >Emne: Re: [Jprogramming] Transcomputational numbers > > >If there are n variables each of which can take k states, isn't the number >of possible states n^k rather than k^n? Just think of the limiting case >where there is 1 variable and 4 states. > >(The algebraic manipulations in the solution would be similar.) > > >On Tue, Apr 30, 2013 at 1:17 PM, mikel paternain <mikelpa...@hotmail.es>wrote: > >> A system of n variables, each of wich can take k diferents states, can >> have k^n possible system states. To analyze such a system, a minimum of k^n >> bits of information are to be processed. The problem becomes >> transcomputational when k^n > 10^93. >> >> Find a J verb or expression for n if k=2,3,4,5,....and k^n>10^93 >> >> JoJ team >> >> >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm >> >---------------------------------------------------------------------- >For information about J forums see http://www.jsoftware.com/forums.htm > > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
