HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
CatsAreFluffy
metamath-turing-machines
Tcl2024–2025
CatsAreFluffy / metamath-turing-machines

metamath-turing-machines

metamath proof enumerators and other things

2Distinct people
2Mentions
0Explicit recommenders
13GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

metamath proof enumerators and other things

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by month2 dated mentions

Observed mentions: 2024-08-13 19:51:48 UTC to 2025-10-18 07:11:30 UTC.

012024-08-01 00:00:00 UTC to 2024-09-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsAug 20242024-09-01 00:00:00 UTC to 2024-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-01 00:00:00 UTC to 2024-11-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-11-01 00:00:00 UTC to 2024-12-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-12-01 00:00:00 UTC to 2025-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-01-01 00:00:00 UTC to 2025-02-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-02-01 00:00:00 UTC to 2025-03-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-03-01 00:00:00 UTC to 2025-04-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsMar 20252025-04-01 00:00:00 UTC to 2025-05-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-05-01 00:00:00 UTC to 2025-06-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-06-01 00:00:00 UTC to 2025-07-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-07-01 00:00:00 UTC to 2025-08-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-01 00:00:00 UTC to 2025-09-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-09-01 00:00:00 UTC to 2025-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-10-01 00:00:00 UTC to 2025-11-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsOct 2025

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Aug 20242024-08-01 00:00:00 UTC2024-09-01 00:00:00 UTC101
Sep 20242024-09-01 00:00:00 UTC2024-10-01 00:00:00 UTC000
Oct 20242024-10-01 00:00:00 UTC2024-11-01 00:00:00 UTC000
Nov 20242024-11-01 00:00:00 UTC2024-12-01 00:00:00 UTC000
Dec 20242024-12-01 00:00:00 UTC2025-01-01 00:00:00 UTC000
Jan 20252025-01-01 00:00:00 UTC2025-02-01 00:00:00 UTC000
Feb 20252025-02-01 00:00:00 UTC2025-03-01 00:00:00 UTC000
Mar 20252025-03-01 00:00:00 UTC2025-04-01 00:00:00 UTC000
Apr 20252025-04-01 00:00:00 UTC2025-05-01 00:00:00 UTC000
May 20252025-05-01 00:00:00 UTC2025-06-01 00:00:00 UTC000
Jun 20252025-06-01 00:00:00 UTC2025-07-01 00:00:00 UTC000
Jul 20252025-07-01 00:00:00 UTC2025-08-01 00:00:00 UTC000
Aug 20252025-08-01 00:00:00 UTC2025-09-01 00:00:00 UTC000
Sep 20252025-09-01 00:00:00 UTC2025-10-01 00:00:00 UTC000
Oct 20252025-10-01 00:00:00 UTC2025-11-01 00:00:00 UTC101

What Hacker News says

2 sources
The mistake that you are making is to imagine that I must be making a mistake. Let's take a few examples. He claims that a robot which is able to engage in Gödelian reasoning, cannot possibly be computable. Logicians agree that this claim is false. Indeed https://link.springer.com/article/10.1007/s10817-021-09599-8 shows a version of Gödel's theorem that has been fully checked via proof assistant. While we still lack AIs that are able to produce such proofs (other than by regurgitating such proofs in their input data), in principle a proof checker filtering the output of a brute force search through possible proof attempts will achieve any possible machine checked proofs. But proof checkers can proof check Gödelian reasoning. Thus we already know how to write a (rather impracticable) robot that does exactly what Penrose claims to be impos
Read the rest
sible. Here's a whopper. Let's go to this passage from 4.2 of his rebuttal. However, I had been disturbed by the possibility that there might be true mathematical propositions that were in principle inaccessible to human reason. Upon learning the true form of Gödel's theorem (in the way that Steen presented it), I was enormously gratified to hear that it asserted no such thing; for it established, instead, that the powers of human reason could not be limited to any accepted preassigned system of formalized rules. What Gödel showed was how to transcend any such system of rules, so long as those rules could themselves be trusted. This is complete and utter bullshit. Gödel did not show that we could transcend any such system of rules. What Gödel demonstrated is what those rules can prove of themselves. Namely, "If this set of axioms proves itself consistent, then it is inconsistent." Which statement can be proven using nothing more than arithmetic. Our ability to prove this doesn't prove that our mathematical reasoning is somehow beyond what a mere formal system can prove. It is just a demonstration that we can follow a piece of arithmetic to its logical conclusion. Any other understanding of the result is simply a mistake. He's also wrong about whether there are problems that, in principle, are beyond human reason. For example consider the BB(n) problem. Identifying which Turing machine gives us BB(643) is impossible from ZFC. (See https://github.com/CatsAreFluffy/metamath-turing-machines for more.) If you go to BB(1000), no set of axioms that mathematics has ever debated can suffice. Going beyond human comprehension doesn't take much more than that. Of course those are weak estimates. In fact it is likely that BB(10) is going to be forever beyond us. And no, some magic quantum decoherence in the microtubules isn't going to fix that. Let's move on. Section 4.5. He admits to the logical possibility that he is wrong, then asks whether unsoundness is plausible. How is it not plausible? The only form of intelligence that we have an existence proof for, us, thinks in notoriously unreliable ways. LLMs are our best attempt to replicate our verbal abilities by computers. They are likewise extremely unsound. The burden of proof that soundness is possible here is on Penrose. And he needs to prove it soundly enough to overturn the generally accepted conclusion that the known laws of physics suffices, in principle, to explain the manner by which our brains operate. Because that is the conclusion that he is aiming to convince people of. He doesn't even try. He waves his hands, declares absurdity, and moves on. That may be fine from the point of view of his philosophy. It is not fine from the point of view of a logician. It's a gap. And a mighty big one at that. I could go on, but what's the point? If you refuse to believe what logicians say about logic, then no explanation of what logicians have to say will convince you. And if you do believe what logicians say about logic, then you should already know that Penrose is wrong.
In Intercellular communication in the brain through a dendritic nanotubular network
It doesn't matter how clever the AI is: the problem is mathematically impossible. The behaviour of some programs depends on Goldbach's conjecture. The behaviour of some programs depends on properties that have been proven independent of our mathematical systems of axioms (and it really doesn't take many bits: https://github.com/CatsAreFluffy/metamath-turing-machines). The notion of "algorithmic similarity" cannot be described by an algorithm: the best we can get is heuristics, and heuristics aren't good enough to get TDT acausal cooperation (a high-dimensional unstable equilibrium). In practice, we can still analyse programs, because the really gnarly examples are things like program-analysis programs (see e.g. the usual proof of the undecidability of the Halting problem), and those don't tend to come up all that often. Except, TDT though
Read the rest
t experiments posit program-analysis programs – and worse, they're analysing each other… Maybe there's some neat mathematics to attack large swathes of the solution space, but I have no reason to believe such a trick exists, and we have many reasons to believe it doesn't. (I'm pretty sure I could prove that no such trick exists, if I cared to – but I find low-level proofs like that unusually difficult, so that wouldn't be a good use of my time). > Remember that infinite precision is an infinity too and does not really exist. For finite discrete systems, infinite precision does exist. The bytestring representing this sentence is "infinitely-precise". (Infinitely-accurate still doesn't exist.)
In There Is No Antimemetics Division (2018)

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.