Fair warning, this is probably a hard problem compared to other ones I have shared here before.
Let's consider this a test to see if there is interest in such problems...
Consider a number $x$ between 0 and 1, and the following game:
At each step, define $d$ as:
You then randomly move $x$ to the left or right by a distance $d$. After each move, update the value of $d$ accordingly, and continue until $x$ reaches either 0 or 1.
To clarify:
- At each step, you have a 50% chance of moving $x$ to the nearest endpoint (either 0 or 1).
- You also have a 50% chance of moving $x$ away from the nearest endpoint.
The question is: in terms of $x$, what is the probability that the game ends at 1?
I'll post a hint tomorrow in case I don't see any progress in a reasonable amount of time.
Previous iteration: https://stacker.news/items/712599
More gradual building out of lightning services and adoption from merchants. Slow is smooth and smooth is fast.
Rapid adoption, because that probably means the dollar collapsed or totalitarian CBDC's got pushed through. Many people aren't even remotely ready for a switch to Bitcoin and we would see lots of lost wealth from mishandling.
I expect more and more alternatives to Big Tech platforms, especially as censorship season ramps up in America.
Carnivore diet, but that's pretty tangential to all the important things they're getting right.
I use https://cursor.sh a fork of VScode with AI built-in. I can highlight a block of code and ask GPT to adjust it. Then I get an inline diff with the option to ACK/NACK or follow-up all without leaving the editor.
I found GPT is useful when:
I have found GPT is NOT useful when:
In summary, GPT will not turn non-devs into devs overnight. If however, you already understand a problem and already know how to solve it, GPT will make light work of actually getting it done.