last day (15 days later) » 

3:12 AM
18
A: Biggest Irreducible Hello World

Jono 2906Keg, \$ 1.92 * 10^{7813503} \$ bytes Rather than put the actual program here, I put the program generator I used (written in Python 3): prog = [] for char in reversed("Hello, World!"): number = (ord(char)) * (ord('🂓') ** ord('🂓')) add = "" for l in str(len(str(number))): ...

 
An explanation of how this is irreducible would be appreciated
 
When I tested it, it produced the score mentioned and the program.
:_ Is needed to terminate the integer scan
 
That's a weird feature in a golfing language
 
@JoKing I've added an explanation
@FabianRöling explanation added.
 
Looks like you're printing the sum of number of zeroes, rather than the concatenation as I think you want. I'm also not seeing why the whole multipky by 🂓 can't be removed. Surely parts can just be reduced to +ℤ, with the appropriate amount of zeroes?
 
3:12 AM
The muliply by the character is needed to convert the chunks back to their original number
 
Reduced, with the number of 0s represented by an actual number and the ! excluded
Your generator program is still wrong, since it prints far less 0s than your score would suggest, and also prints the code backwards. My reduction still somewhat applies, since you can reduce the number of leading zeroes, and replace the part for H with just ⅍+ℤ,, similarly with the rest of the characters
 
Adding this line: print(len(str(number))) shows that each letter has ~ 648k 0s
And that times 13 letters gives 8,435,258
But I do see that the lengths are reversed
But with the right fixes, this would still work
As I tested the fundamentals of it with smaller numbers
So I believe the generator (after I fix the reversing issue) does work correctly
 
3:33 AM
@Jono2906 So you're only printing 8 million zeroes? That's a far cry from 10**7813503
Also, how are you addressing the point I made above with reducing the program?
It's also still backwards, and now you're not even printing the zeroes. Also you can use floor(log10())+1 instead of len(str()) to speed it up tremendously
 
@JoKing no, wait. I figured out that I am indeed printing the promised 10**7813503 0s
Because that's just the length of the number of the number of 0s
 
@Jono2906 Did you do 5; to avoid using 4s? You know I could have used any of those numbers right, not just 4?
 
@JoKing maybe...
 
@Jono2906 Well, you weren't, you were just printing that many zeroes. Again, you should be printing the concatenation of the numbers, not the sum of them
@Jono2906 Your generator should be something like this
Though I've commented out the easily reducible (🂓|ℤ🂓/) part
 
3:54 AM
@JoKing but that's what I'm doing
And I just remembered I forgot to mention that after all those 0s there is a ! ÷
Because when I edited in the generator, i cleared my old post
Which had the explicit
But I forgot that I had erased that part
 
@Jono2906 You want to print the number of zeroes such that the total number is equal to the concatenation of the representation of each letter right?
Like if there were 5 characters with values 1, 2, 3, 4, 5 you'd print 12345 zeroes?
What you were doing instead was printing that many zeroes in sequence
So you printed one zero, two zeroes etc... for a total of 15 zeroes instead of 12345 zeroes
 
@JoKing I just thought of that as well.
I'll change my generator accordingly
But I'm having troubles thinking of how to keep my score and still have an irreducible program.
Any suggestions?
 
4:12 AM
@Jono2906 I don't think you can. Your (🂓|ℤ🂓/) part is entirely removable. This whole strategy can be boiled down to ⅍+ℤ, for the two digit long character codes. You'll have to change your strategy if you want a larger score
 
Back to the drawing board it is then.
 
Make sure to delete or fix your answer while you're working on it
 
 
18 hours later…
10:35 PM
@Jono2906 You can still remove the 🂓/ very easily
I also don't think you've "won this challenge" lol
Why don't you try putting the 🂓 as the loop number instead? That will get you a much higher score, and should be hard to remove (but only applies to the character codes higher than 99)
@Jono2906 Right, I can't see anything wrong with that. Try replacing the 4s with 🂓
Or even 􏿿. Dunno why you're using a smaller character
 
I'm experiencing a bit of a mind blank as to how I would implement your suggestion... could you explain it a bit more
 
Try replacing the 4s with 􏿿
and adding a whole lot more leading zeroes
 
Aha. I see
As I said. A pure and utter mind blank
Too much Java development
So something like this?
÷(3|⅍+)ℤz/ℤ,(4|(􏿿|⅍+)ℤz/ℤ,)(3|⅍+)ℤz/ℤ,(3|⅍+)ℤz/ℤ,(5|(􏿿|⅍+)ℤz/ℤ,)(3|⅍+)ℤz/ℤ,
Ugh. 􏿿 is messing up the program formatting
@JoKing I just found out why... It overwrites other characters somehow
 
10:53 PM
No, just replace the 4s in your original program
 
@JoKing I realised I was manipulating the wrong program
􏿿 and don't play nicely together
 
works fine for me
 
On TIO that is
@JoKing One last question: how do I go about calculating the massive number that replacing 4 with 􏿿 would give?
 
... works fine for me
Well, it's probably something like 10**(0x10FFFF*8)
um wait, one sec
yeah, that's right
@Jono2906 3.3 * 10**8912898
 
Okay then. I'll put that onto my answer
Thanks for the help!
:)
 
11:06 PM
for future score increases, try looking for a way to generate an extremely large number that can't be reduced to a smaller one, and replace the 􏿿 with that
kinda hard, since you can't use any numbers in it
 
Hey, does the program render properly on your side?
 
Yup
 
Don't worry, it's just chrome that's being special
 
also on chrome
 
Safari somehow renders it correctly but Chromium doesn't
@JoKing Wait what?
MacOS or Windows?
 
11:10 PM
Linux
 
Ah.
 

last day (15 days later) »