Viewing profile — 2ro

How about this? https://mathstodon.xyz/@empty/115088095028020763

mine: https://ytp.me/ ("empty" backwards) your approach excites me very much and i want to try it for myself !! thank you :))

someone should embed Prolog or microKanren

https://bear-images.sfo2.cdn.digitaloceanspaces.com/zett/img...

Don Knuth Marcus Hutter Terry Fuller Tom Standish

1/4+2/8+3/16+4/32+5/64+...=1

was right before

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 X…

test

If you notice, one of the most recognizeable features of the Mandelbrot set is a cardioid shape when completely zoomed out. Imagine looking for all the other patterns that are pres…

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 X…

I am not a good communicator but if you are willing to look past that, the idea is interesting.

Read mine: https://ytp.me/ (work very much in progress)

I ask, are you yourself doing anything other than this when you think and act?

The recursive nature of this architecture could lead to long chains of reasoning punctuated by brilliant moments of imagination.

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 …

In modern software development, do people still use pseudocode before writing computer code? I am kind of fascinated by the idea of improving my programming skill by focusing on th…

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

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 Th…

Sort up to some maximum number of items (N items) on a machine with N^2 processors: for each of the N items in the input array, which we assume are distinct, we will designate N-1 …