ct: Re: [Jprogramming] Goodstein Sequences and Hereditary base-n notation
To: programm...@jsoftware.com
Date: Thursday, April 12, 2018, 12:01 AM
Hi,
This is my tacit version. Not claiming speed
(or anything in the way of code legibility for that matter).
The important verb is hbi, hereditary
;agroeneveld...@gmail.com> wrote:
Subject: Re: [Jprogramming] Goodstein Sequences and Hereditary base-n
notation... CRASH!
To: programm...@jsoftware.com
Date: Thursday, April 12, 2018, 6:38 AM
I noticed it has to do with the
0=y testing in S. Instead of producing a
zero at a certain point i
I noticed it has to do with the 0=y testing in S. Instead of producing a
zero at a certain point it gives a small value 4.4e_16 and then
starts filling the stack.
Op 11-04-18 om 22:05 schreef Jose Mario Quintana:
You might like to look also at Arie Groeneveld's message,
[Jprogramming]
Use this:
2x G"0 i.4
2 3 5 7
Op 11-04-18 om 22:05 schreef Jose Mario Quintana:
You might like to look also at Arie Groeneveld's message,
[Jprogramming] Crash calculating large hyper operations
http://www.jsoftware.com/pipermail/programming/2015-November/043351.html
Unfortunately,
What is the maximum recursion depth reached by this program?
Henry Rich
On 4/11/2018 4:05 PM, Jose Mario Quintana wrote:
You might like to look also at Arie Groeneveld's message,
[Jprogramming] Crash calculating large hyper operations
Hi,
This is my tacit version. Not claiming speed (or anything in the way of code
legibility for that matter). The important verb is hbi, hereditary base-x
incrementation of y used in creating the Goodstein sequence.
My gs verb uses a starting base of 2, and gss starts with base x:
hbi=: ([ (]
My first answer was actually comletely wrong, and only works for the simplest
cases. This is a more robust and correct solution
goodstein=: 4 : 0"0 0
if. y = x do.
x+1 return.
elseif. y = 0 do.
0 return.
end.
s=. I. x (|.@:((>:@:>.@:^. # [) #: ])) y
d=. (x+1) ^ (x:x) goodstein x: s
+/d
)
