Just for recreational purposes here's yet another obfuscated Awk code.
func ___(_) { return __(_,x^x,x^x^x) }
func __(_,_x,x_) { return --_?__(_,x_,_x+x_):_x+x_ }
{ print ___($_) }
Solutions, guesses, comments, improvements, fixes, requests for hints,
etc. are all welcome.
Janis
Just for recreational purposes here's yet another obfuscated Awk code.
func ___(_) { return __(_,x^x,x^x^x) }
func __(_,_x,x_) { return --_?__(_,x_,_x+x_):_x+x_ }
{ print ___($_) }
Solutions, guesses, comments, improvements, fixes, requests for hints,
etc. are all welcome.
Janis
it's not even limited by 2^-1023 or 2^-1074. since once you're past
-2^53, unitary pre-decrementing a number keeps it stuck there, since
it lacks the ability to accumulate your non-representable odd numbers
in double precision, and will go on for quite some time until the
either input position 2 or 3 in the two-underscore function reaches
2^1024 infinity
just my random uneducated guess
as for function called by print, the 3-underscore one, all of those
are pure distractions, since those reduce to calling two-underscore
function with
__( original-input, 1, 0)
wait … then that's Fibonacci then not Lucas …. i'm confused
@Janus : i just realized because your code doesn't perform any data scrubbing, anything that's not a positive integer immediately stack
overflow due to infinite loop
[...]
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 296 |
Nodes: | 16 (2 / 14) |
Uptime: | 53:15:52 |
Calls: | 6,650 |
Calls today: | 2 |
Files: | 12,200 |
Messages: | 5,330,489 |