| ▲ | Betelbuddy a day ago |
| Just a proof of the infinite monkey theorem: Give a sufficiently large number of monkeys keyboards....gently nudge them in the right direction with a few banana tokens...let them type away with just enough randomness for an infinite amount of time. Eventually, they will almost surely produce any mathematical proof imaginable... |
|
| ▲ | mbowcut2 a day ago | parent | next [-] |
| I genuinely can't tell if this is sincere or sarcastic. |
| |
| ▲ | hansvm a day ago | parent | next [-] | | My best guess is it's sincere. That's been a core observation of LLMs for awhile. Filtered random search is basically an inefficient gradient descent. If you apply even a poor-quality "gradient" to a lot of problems with infinite compute (with large LLM budgets), it doesn't take that good of an LLM to accomplish great things from time to time. | | |
| ▲ | foltik 19 hours ago | parent | next [-] | | “Shine light on a random clump of atoms for long enough and it shouldn't be surprising that you get a plant.” | |
| ▲ | TheOtherHobbes a day ago | parent | prev [-] | | We've graduated to motivated stochastic parrots. |
| |
| ▲ | qup a day ago | parent | prev [-] | | There's enough information available to decide. Start with the title of the article |
|
|
| ▲ | slyrus a day ago | parent | prev [-] |
| It was the best of times, it was the blurst of times. |