Allen Mouse Brain Common Coordinate Framework Updated 2025-07-16
TeachMeAsap.com Updated 2025-07-16
They sent one of the rare spams Ciro actually was interested in!!! Likely going down lists of top Stack Overflow users.
They have some kind of cryptocurrency, TCHME token, as a reward. Ciro wonders if the value of TCHME will ever be high enough to serve as a valid incentive.
Also, what is the total TCHME supply? Can the website devs issue as much as they want? They do giveaways e.g. as shown at: twitter.com/TeachMeAsap/status/1621353671840899072
And a centralized system with a certralized marketplace would work just as well for the initial phases. But fair play, the idea is interesting.
Insanely active poster on Stack Overflow 4chan post (2023-07-03) Updated 2025-07-16
archive.ph/Dd3aC web.archive.org/web/20230709141533/https://desuarchive.org/g/thread/94445084/#94448535 desuarchive.org/g/thread/94445084/#94448535
Most of the thread went into pro/anti gay trashtalk due to Ciro using Gay Putin at the time on his Stack Overflow profile as a useless way to protest the Russian invasion of Ukraine.
Some comments:
How does this guy manage to be so active on Stack Overflow? I feel like this disgusting avatar is on at least a quarter of all the active posts.
The answers are always pretty good though.
Obviously severe autism. Also racism homophobia Looks like everything is ok if it's Russia/Chinese...
The only new information:
Reminds me of Xah Lee.
CIA 2010 covert communication websites secure subdomain search on 2013 DNS Census Updated 2025-07-16
Grepping the 2013 DNS Census first by overused CGI comms subdomains
secure. and ssl. leaves 200k lines. Grepping for the overused "news" led to hits:- secure.worldnewsandent.com,2012-02-13T21:28:15,208.254.40.117
- ssl.beyondnetworknews.com,2012-02-13T20:10:13,66.104.175.40
Also tried but failed:
sports:- secure.motorsportdealers.com,2012-04-10T20:19:09,64.73.117.38 web.archive.org/web/20110501000000*/motorsportdealers.com
OK, after the initial successes in New results: only one...
secure., we went a bit more data intensive:- took all
secure.*ssl.*URLs in the 2013 DNS Census, 70k entries - cleaned up a bit, e.g. only
.comor.net. this left only, 30k entries only - lopped over all of them in archive CDX: Wayback Machine CDX scanning, searching for those that also end in
.cgiweb.archive.org/cdx/search/cdx?url=$domain&matchType=domain&filter=urlkey:.*.cgi&to=20140101000000. Took an afternoon, but no rate limit block. - this leaves about 1000, so we loop over all of them manually on web archive with a script, and opened any that had the pattern of very vew hits between 2010 and 2013 only, and on those check for visual/thematic style match. Careful not to make more than 15 requests per minute or else 5 min blacklist!
- 208.254.42.205 secure.driversinternationalgolf.com,2012-02-13T10:42:20,
After 2013 DNS Census virtual host cleanup heuristic keyword searches we later understood why there were so few hits here: the 2013 DNS Census didn't capture the
secure. subdomains of many domains it had for some reason. Shame, because if it had, this method would have yielded many more results. Printed circuit board Updated 2025-07-16
Alloy Updated 2025-07-16
Instrumentation (computer programming) Updated 2025-07-16
Instrumentation basically means adding loggers/print statements to certain points of interest of your hardware/software.
The downside is that if the instrumentation does not provide you the data you need to debug, there's not much you can do, you will need to modify it, i.e. you don't get full visibility from instrumention.
This is unlike emulation that provides full observability.
Integer factorization algorithms better than Shor's algorithm Updated 2025-07-16
- 2023 www.schneier.com/blog/archives/2023/01/breaking-rsa-with-a-quantum-computer.html comments on "Factoring integers with sublinear resources on a superconducting quantum processor” arxiv.org/pdf/2212.12372.pdf
A group of Chinese researchers have just published a paper claiming that they can—although they have not yet done so—break 2048-bit RSA. This is something to take seriously. It might not be correct, but it’s not obviously wrong.We have long known from Shor’s algorithm that factoring with a quantum computer is easy. But it takes a big quantum computer, on the orders of millions of qbits, to factor anything resembling the key sizes we use today. What the researchers have done is combine classical lattice reduction factoring techniques with a quantum approximate optimization algorithm. This means that they only need a quantum computer with 372 qbits, which is well within what’s possible today. (The IBM Osprey is a 433-qbit quantum computer, for example. Others are on their way as well.)
Chinese thing better known in the West as Japanese Updated 2025-07-16
AlphaFold Updated 2025-07-16
AlphaGo Updated 2025-07-16
AlphaGo Zero open source implementation Updated 2025-07-16
CRC-32 Updated 2025-07-16
Alternating and direct current Updated 2025-07-16
Alternating current source Updated 2025-07-16
Primitive recursive function Updated 2025-07-16
In intuitive terms it consists of all integer functions, possibly with multiple input arguments, that can be written only with a sequence of:and such that
- variable assignments
- addition and subtraction
- integer comparisons and if/else
- for loops
for (i = 0; i < n; i++)n does not change inside the loop body, i.e. no while loops with arbitrary conditions.n does not have to be a constant, it may come from previous calculations. But it must not change inside the loop body.Primitive recursive functions basically include every integer function that comes up in practice. Primitive recursive functions can have huge complexity, and it strictly contains EXPTIME. As such, they mostly only come up in foundation of mathematics contexts.
The cool thing about primitive recursive functions is that the number of iterations is always bound, so we are certain that they terminate and are therefore computable.
This also means that there are necessarily functions which are not primitive recursive, as we know that there must exist uncomputable functions, e.g. the busy beaver function.
Adding unbounded while loops of course enables us to simulate arbitrary Turing machines, and therefore increases the complexity class.
More finely, there are non-primitive total recursive functions, e.g. most famously the Ackermann function.
Crank (person) Updated 2025-07-16
Yet, all breakthroughs, comes from them, because the people who are crazy enough to believe they can change the world are the ones who actually do ;-)
Amadeus (film) Updated 2025-07-16
Amateur astronomy Updated 2025-07-16
Amateur radio Updated 2025-07-16
There are unlisted articles, also show them or only show them.