6
points
tromp
Joined 10,655 karma
tromp.at.hn
Homepage https://tromp.github.io/
[ my public key: https://keybase.io/tromp; my proof: https://keybase.io/tromp/sigs/OIh7YRNoX27zpivZChym7bu8wglnzykfaYP02_6deXI ]
- Any implementation of Shor will need vanishingly small amplitudes, as it forms a superposition of 2^256 classical states.
- Using Brave on MacOS, I cannot scroll the page to see the entire text. On Firefox, it scrolls fine.
- I realize this is a minority opinion, and goes against all theories of how quantum computing works, but I just cannot believe that nature will allow us to reliably compute with amplitudes as small as 2^-256. I still suspect something will break down as we approach and move below the planck scale.
- > better privacy, or easier scaling
You can get both [1] without trading away anything except trusting Pedersen commitments to actually commit to their values (i.e. no-one ever able to compute one particular EC discrete log).
> they often sacrifice decentralization or long-term economic incentives.
One could argue that Bitcoin's capped supply sacrifices long-term economic incentives as its shrinking security budget threatens long term network security, and that an uncapped supply better serves long-term economic incentives [2].
- It turns out that Rush Hour becomes much harder if we shrink the cars from size 2x1 to size 1x1, while maintaining their direction to be either horizontal or vertical [1]. While the hardest 6x6 Rush Hour puzzle takes 51 moves, the hardest Unit Rush Hour puzzle takes a whopping 732 moves [2].
- You can only have one URL for each scheme though, else your compiler will report something like
error: redefinition of label 'https'
- If coding is the purest form of art, then lambda calculus may be the purest form of code. Its graphical representation [1] also looks somewhat artistic.
- It's far from accurate, since ((1+sqrt(5))/2)^-7 ~ 0.03444
- I think it's a little preposterous to conjecture that the inverse of the fine structure constant is "governed" by the expression N^2+C^2 + ((1+sqrt(5))/2)^(N-C) with N=11 and C=4. You can probably find hundreds more approximations by other arbitrary formula of similar complexity, all lacking in explanatory power of why the formula should look like that.
- I just see a generic Google Drive page saying I need to request access. You may need to set public access...
- I linked to the paper in a recent comment [1]. The author has been active in the Higher Order Community Discord channel for quite a while. The Higher Order Company [2] is developing HVM (Higher Order Virtual Machine), a high performance implementation of interaction nets for both CPUs and GPUs, and started the channel to discuss development and related topics, such as the Bend language for programming the HVM, discussed on HN at [3].
The paper manages to present previous work on Levy's optimal beta reduction in a more streamlined fashion, generalizing duplicators to so-called replicators that avoid the need for separate book-keeping gadgets (like croissants and brackets) . Its author also proves himself to be a skilled programmer in bringing his theory to life with this web based evaluator.
The app contrasts traditional graph-based λ-calculus reduction (which replaces nodes with entire subgraphs) with interaction (which makes only local modifications and hence needs more steps), while showing that semantics is preserved.
[1] https://www.hackerneue.com/item?id=46034355
- > there's an easy way to translate LC to IN
While easy, it sadly doesn't preserve semantics. Specifically, when you duplicate a term that ends up duplicating itself, results will diverge.
There exist more involved semantics preserving translations, using so-called croissants and brackets, or with the recent rephrased approach of [1].
Forget the talk about amplitudes. What I find hard to believe is that nature will let us compute reliably with hundreds of entangled qubits.