2ro

5 ms·

1.
by 2ro 11mo ago
How about this? https://mathstodon.xyz/@empty/115088095028020763
2.
Wigner's Friend Thought Experiment(mathstodon.xyz)
1 points by 2ro 11mo ago|0 comments
3.
Continuous operation of a coherent 3,000-qubit system(nature.com)
2 points by 2ro 1y ago|1 comments
4.
by 2ro 1y ago
mine: https://ytp.me/ ("empty" backwards) your approach excites me very much and i want to try it for myself !! thank you :))
5.
by 2ro 1y ago
someone should embed Prolog or microKanren
6.
by 2ro 2y ago
https://bear-images.sfo2.cdn.digitaloceanspaces.com/zett/img...
7.
by 2ro 2y ago
Don Knuth Marcus Hutter Terry Fuller Tom Standish
8.
by 2ro 2y ago
1/4+2/8+3/16+4/32+5/64+...=1
9.
by 2ro 2y ago
was right before
10.
by 2ro 2y ago
my COmpREss algorithm CORE here it is: a sequence of bits that is not necessarily random can be made to look random - the bits are lined up with pseudorandom bits and each one is XORed in turn example data: 01011010 .. 01001000 pseud
11.
by 2ro 2y ago
test
12.
Ask HN: Can We Do Science on the Mandelbrot Set?
2 points by 2ro 2y ago|1 comments
13.
by 2ro 2y ago
my COmpREss algorithm CORE here it is: a sequence of bits that is not necessarily random can be made to look random - the bits are lined up with pseudorandom bits and each one is XORed in turn example data: 01011010 .. 01001000 pseud
14.
Show HN: COmpREss (a new compressor)(ytp.me)
2 points by 2ro 2y ago|7 comments
15.
Show HN: Compiler in One Line of Code(ideone.com)
2 points by 2ro 2y ago|0 comments
16.
by 2ro 2y ago
Read mine: https://ytp.me/ (work very much in progress)
17.
by 2ro 2y ago
I ask, are you yourself doing anything other than this when you think and act?
18.
LLM composes logic programs which call on LLM to compose more logic programs ...
1 points by 2ro 2y ago|1 comments
19.
by 2ro 2y ago
So, this sounds like you could use a pure logic programming notation - specify intended functionality without any implementation details at all - that is basically what I am doing - I am attempting to create an ideal language notation for e
20.
Ask HN: Can pseudocode make you a better programmer?
5 points by 2ro 2y ago|4 comments
21.
by 2ro 2y ago
a variation of this which may be useful is to use N processors to sort upto N items - in this case the sort becomes O(N) in time
22.
by 2ro 2y ago
How can I assist you today? You said i have an o(1) time-complexity sorter which could be implemented in hardware - do you know about others who have achieved this? Copilot said That's fascinating! Achieving O(1) time complexity for so
23.
Consider the hardware realizable and efficient O(1) time complexity sorter
1 points by 2ro 2y ago|2 comments
24.
Lark Topics: Productivity Glossary(larksuite.com)
1 points by 2ro 2y ago|0 comments
25.
Zoea – Composable Inductive Programming(zoea.co.uk)
1 points by 2ro 2y ago|0 comments
26.
by 2ro 2y ago
What if there was a website that made it dead simple to work publicly on new compilers and learn from others doing the same? I don't mean like github - I mean you should be able to see and run code in the browser and learn from others
27.
Ask HN: Is there a hobbyist community for small compiler projects?
3 points by 2ro 2y ago|2 comments
28.
by 2ro 2y ago
So, I would like to create/discover patentable algorithms. One would not even have to run the logic programs in the normal sense - just interpret the declarative constraints in a direct way as a fitness function in the GP system...
29.
Ask HN: Use Prolog to specify fitness function in a genetic programming context?
3 points by 2ro 2y ago|3 comments
30.
by 2ro 2y ago
As a technological matter, disregarding probable human behavior, can it be done?

More ›