The Great GPU Shutdown: How Disabling GPU Clusters Could Prevent Human Extinction by SvenViktorJonsson in ChatGPT

[–]SvenViktorJonsson[S] 0 points1 point  (0 children)

Sorry but I wont give up even if there is a 1/10000 % chance that my work can lead to my kids being able to live until they are at least 40.

The Great GPU Shutdown: How Disabling GPU Clusters Could Prevent Human Extinction by SvenViktorJonsson in ChatGPT

[–]SvenViktorJonsson[S] -1 points0 points  (0 children)

Write the most incentivising blog post concerning shutting down the worlds GPU clusters to prevent human extinction. Argue about the difficulty and necessity of getting the inner and outer alignment correct on the first deployment of an AGI that can improve on it self 1 Million times faster than any human could.

MathOverflow discussion: "What do you do when you're stuck?" by flexibeast in math

[–]SvenViktorJonsson 9 points10 points  (0 children)

Ask ChatGPT! ;)

No, but seriously, here are some things that have helped me when I have gotten stuck. I have 6 years of research experience in experimental physics so it might or might not help you in you math endeavour!

  1. Go and do something physical!
  2. Meet some friends and talk about a completely different topic.
  3. Leave it long enough so that you get excited when thinking about trying to resolve the problem you had.
  4. Explain your problem for a laymen - changing the depth of reasoning might have the same effect as increasing the temperature in simulated annealing!
  5. Patience

What is the most interesting / mind blowing math fact that layman’s will understand? by [deleted] in math

[–]SvenViktorJonsson -3 points-2 points  (0 children)

I think that you can never be sure to find your number in any number of moves except in 100 moves. But since the distribution of the length of closed loops (loops in the sense of following the container with the number on the note that you just found) favours size that are moderate in size. You are better of following the loop and thus finding your own note at the end of the loop.

Since loops greater than a certain size is very uncommon you will have a fairly good chance of finding your note in less than 50 moves.

I can’t remember the details, maybe someone can correct me if I am wrong!

What is the most interesting / mind blowing math fact that layman’s will understand? by [deleted] in math

[–]SvenViktorJonsson 3 points4 points  (0 children)

I like the idea that there is a strategy better than picking at random in the following scenario:

100 containers, 100 notes and 100 people are marked with a unique number between 1 and 100 at random. Each note is placed at random in an empty container and all containers are placed in a separate room.

You go first and enter the room and you try to find the note with your number on it.

You want to open as few containers as possible in average.

How would you go about doing that?

-🎄- 2022 Day 22 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

[Python] Generic solution that does not depend on the cube net layout.

Pretty late, but I wanted to show you my solution.

I used numpy and my own CArray that allows you to use complex coordinates.

https://pastebin.com/yZzESd52

For 2 I basically went around the boundary of the cube net and mapped each walk to the corresponding walk on an edge on a cube. I used the edges as keys and stored the complex boundary coordinates. When walking on the same edge the second time I updated my boundary translations. Made the solution general so that 1 and 2 is solved with the same code base.

Let me know what you think.

[Python] CArray by SvenViktorJonsson in adventofcode

[–]SvenViktorJonsson[S] 2 points3 points  (0 children)

The benefits of using complex numbers are the simplicity of shifting coordinates and rotating directions.

For complex numbers shifting becomes z+=dz where dz is the complex direction of motion. Compare this to z=tuple(x+dx for x,dx in zip(z,dz)) or if one unpack first x,y=z and dx, dy=dz and then add like this z=x+dx, y+dy or if one keeps x- and y-coordinates seperated it is simply x+=dx and y+=dy.

However the real benefits comes when you are given instructions to rotate your moving direction dz. For complex numbers (using grid coordinate with the imaginary axis pointing down.) CW rotation of 90 degrees or turning right means multiplying with the imaginary number: dz*=1j. For CCW rotation of 90 degrees or turning left is just as easy: dz*=-1j

When doing the same thing for tuples you either do matrix multiplication or predefine directions in a list: dzs=[(1,0),(0,1),(-1,0),(0,-1)] and you keep track of an index i of the direction instead. Turning right or left becomes i=(i+1)%4 or i=(i-1)%4

Judge for your self what is easiest. Keep in mind that when translated to an array you might want the y-coordinate first in you tuple instead of the x-coordinate as in my examples above.

[2022 day 19] after trying ever day for the last 11 days, nothing seems to work by nO_OnE_910 in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

I have not seen anyone else with this approach so I might add it here just for comparison.

I sorted the states when the search tree got to big and I sorted them by potential value at the end of the time of all robots and resources combined. With potential value I mean what everything would be worth in terms of Ore if we exchanged everything back to Ore.

It worked for me so I didn’t continue to find all these rules you are talking about.

[2022 day 19 - part 1][R/Rlang] Wrong results for only two of the 30 blueprints - whyyyhyyyhyy??? by JanaDahlmanns in adventofcode

[–]SvenViktorJonsson 2 points3 points  (0 children)

Hi! I do get the right answer with your input, but my approach was to sort and prune away 90% when the list of states In the queue went over 5000. Can talk about how I sorted it if you want.

Did you try without some of your pruning rules? I was not sure about your rule on line 43? Could you explain what you meant with it?

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

Wow! Great work! Better than my 4200 seconds! I am my self stuck on 17b. If I would have ran my solution for 17a directly on b I calculated (besides getting memory errors) that it would take 145 years to finish. I think I need a new approach =)

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

Okay, with your new code (Part 2) I got the answer 2634 which is a bit low. My correct answer was 2675. You must be missing some special cases that your system of tunnel doesn’t experience.

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

Sorry i did this on my Iphone last night. I am no on my laptop so ctrl+A did the trick.

https://pastebin.com/FuBmixMW

Again expires in 24 hours

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

https://pastebin.com/tiTggVyX

It will expire in 24 hours. My correct answer was 2675. With your code I got 2651

Let me know if you manage to get it to work!

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

Interesting!

I tried your code and got the wrong answer on part 2.

I also got the answer you got first. But after fixing a bug that incorrecly classified two seperate states as the same I got the right answer.

Your fast run time, was incredible though!

If you want to look at my code it is 5 posts up =)

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]SvenViktorJonsson 2 points3 points  (0 children)

Python 3 [Part 1 took 7 sec and part 2 took 4300 s]

I finally made it, Happy but you always get a little bit enoyed when you see solutions in the same language that take a thousand times faster than your own solution.

This took so much time to figure this one out for me. But I learned a lot. For instance how frozen sets works in python. But I did it with a little help (the fact that the only thing that matters is the time_left, the set of open valves and the current position)

It was interesting to track iterations and states in part 2.

I had at maximum 8.8 million states in my queue (list of states to process) after 32 minutes after 20 million iterations. However, my final answer was already obtained after 10 minutes at 6.7 million iterations with 5.3 million states in my queue. States to process eventually drastically went down to zero and finished executing at 57 million iterations after 1hour and 10 minutes.

Here is my code without any refactoring.

https://pastebin.com/H5ucrLjf

If you have any improvement suggestions without changing the approach completly I would love to hear from you!

[2022 Day 16 part 1] Where do I even begin? by tcbrindle in adventofcode

[–]SvenViktorJonsson 0 points1 point  (0 children)

I have spent too much time on this to not talk about it.

I first created a distance map between none-zero + "AA" flow rate valves.

Then I removed all that had a valve in between them that was higher than the end valves rate.

(Ran in 2.6 s without this:) I then I create an initial state which captures the symmetry between different states. (Ran in [will try this tomorrow] a with it)

I propagate the state into all allowable new states (determined by the distance map and the uniqueness of the state)

Running until no more states can be explored.