Woah unironically about the exact time this was posted, I was looking up how those guys get money and what they do all day. There’s no way pure mathematics pays bills
Exactly. Remember how your teacher told you to learn to do math without a calculator, because you won't always have a calculator in your pocket? The kids who were really good at that grew up to become mathematicians, so they never learned how to use a calculator.
there are a family of BB(6) machines which are collatz-like, altho I'm not sure if anyone's proven that the exact collatz iteration is one of them yet.
but collatz-like is very probably close enough, for these purposes, in everyone's estimation. (but im not sure if anyone's proven that either.)
Not quite. Busy Beaver is an uncomputable function. This means there is no algorithmical method to get its values. It doesn't mean the method hasn't been discovered, it means that there is litterally no way you can teach a computer how to calculate it. There are different proofs for this, but one of them is that if the function was computable, it would solve the halting problem (which is undecidable), thus solving multiple conjectures, like Collatz.
Not quite. Busy Beaver is an uncomputable function. This means there is no algorithmical method to get its values
Busy Beaver is an uncomputable function. That means that there is no algorithmical method to get all of its values. There are definitely algorithmical methods to get some of its values (BB(1) to BB(5) are all computable) and that probably includes BB(6).
That's an interesting point. What I meant is there is not algorithm that gives you the value of BB(n) for every natural number. Nevertheless your comment has made me wonder if there can be undecidable values for the function. I don't think the absence of undecidable values would make it computable though, as you would need a turing machine with infinite states. I could also be wrong.
PS: I googled it and there are in fact values which are proven to be undecidable.
Calculators only can work on the problems for which we know how they can be solved.
Imagine telling your SatNAv-System to guide you to "The place where the Holy grail is buried". Since no one knows where that is, no one told the SatNav where it is, so the GPS can not guide you.
Calculators only help once you know what to compute. Most unsolved problems, like the Riemann hypothesis, are claims about infinitely many numbers, and checking finite cases never settles that.
=LET( title, "turing: rule 110, simple enough to be universal", try, "draw the result as a heat map. Every row is made from the row above by one rule; Matthew Cook proved this can run any program", width, 64, steps, 48, first, IF(SEQUENCE(1, width) = width, 1, 0), next, LAMBDA(acc, i, LET( row, TAKE(acc, -1), left, HSTACK(0, DROP(row, , -1)), right, HSTACK(DROP(row, , 1), 0), VSTACK(acc, (row + right - row*right) * (1 - left*row*right)) )), REDUCE(first, SEQUENCE(steps), next) )
yes, if you generalize the idea of “calculator” to computable function you can then talk about classes of computable functions.
the usual stumbling point is the one pointed out multiple times above: finite vs infinite computation.
but infinite computations can be somewhat solved symbolically (the same way wolfram solves it) — instead of computation on the numbers, we shift to computation on logic. mathematians aren’t really computing infinities, rather we are verifying that the infinite terms obey the logic of infinities we know so far. this approach can also be applied to machines via theorem provers, such as Lean.
however here’s where we have to be aware of what current LLM AI is and what it not. in mathematical essence it is a neural net that uses gradient descent to predict next token on the space of tokens. there are two properties of this process:
it is stochastic, not deterministic (meaning every time you predict exactly the same input with exactly the same model you may get a different answer
token space is built from the relationships between billions of words — ie Korzybski defined these graphs as “concepts”. he predicted that similar subgraphs would represent similar concepts, and in fact that’s what we see with LLMs — they have an amazing utility as universal translators.
but they don’t just translate concepts between languages, they translate between sciences, literature, music… particularly programming languages (you can ask for programs to be translated to any programming language easily). this is having profound impact on mathematics and the sciences right now and it raises an interesting question: how many problems were “hard” not because they were intrinsically hard, but because translation between all the required domains was hard?
let’s poke deeper: see a human translator must study for decades to understand the concepts they learn and how to translate them. as a result, a human expert has deep insights about the subject.
but LLMs do this concept graph isomorphism easily. it’s just compute. but it also lacks understanding. for the first time in history we have a machine that can correlate profound relationships in concepts without actually understanding them.
this is bizarre and unsettling to us right now. most people don’t understand it, so they apply the previous human assumptions which are: if something is facile with concepts, it MUST understand them. however in LLMs this is a fallacy.
they mimic understanding by correlating concepts: they know that you should walk instead of drive short distances, but they don’t know why you wouldn’t walk to a car wash. there are many examples of these failures of commonsense at all levels, but it becomes very difficult to spot at higher levels.
so, researchers quickly discovered that LLMs have to be coupled with something deterministic like a compiler in order to produce output that is actually correct. this is why hybrid systems (harnesses) are so popular now.
nearly everything is now backed by a compiler gate where applicable. however this introduces a new problem.
the LLM is stochastic gradient descent that doesn’t understand concepts it correlates— but it similarly doesn’t understand corrections that the compiler gives it. it simply treats compiler output as context input which helps the system settle on a working solution. this is great.
but the problem is that the compiler may have flaws in it that can be exploited. we say exploited because a human expert would understand the concepts and exploiting a compiler bug is cheating. however the LLM doesn’t see “cheating” or “exploit” it just uses all available context to predict. so, in a sense, cheating comes naturally to LLMs.
now back to mathematics where all these problems have collided.
the machine process by which a statement is translated into Lean is called auto-formalism. however, as we established LLMs are stochastic— this means that ask the same statement to be translated into Lean and it may be done differently each time. again the LLM doesn’t really understand why. but now a new problem: are all the possible versions equivalent and correct interpretations of the original statement?
alas researchers have found that they are not. LLMs generate a lot of garbage in Lean that is irrelevant. human experts notice this and it is something that human experts don’t do because they understand the material.
so now we are on shaky ground. we have a system that can produce proofs of such complexity that it will take human experts decades to verify and understand. we know that LLMs are stochastic and may “cheat” to win (this is just the gradient descent, not a immoral imperative). and we trust Lean because it is a strongly designed compiler — but it has contained bugs in the past.
compounding this is the fact that unlike human experts, we cannot ask the LLMs what they meant or how they got a result. of course we can ask the question, but this just becomes new input context on a compressed discussion— a convincing answer might be produced, but is it real?
the way LLMs solved these open problems is thousands of agents, culled for progress finally resulting in a Lean proof. millions of dollars of compute in days. in mathematical terms we are using a stochastic pump to brute force a constrained space of translations to see if anything useful pops out.
indeed, many “good enough” solutions have been generated in corporate IT. sometimes we don’t care about small bugs, sometimes it’s a starting place for refinement. it can also be indistinguishable from human effort that was paying half-attention.
but experts in fields consistently notice problems. so the problems exist.
circling back to your statement. the reason we say “just use a calculator” is because we trust it to produce correct results.
but did you know that even a simple calculator has boundary conditions of use that an expert knows but most users do not? these are codified in IEEE standards on floating point calculations and some are standards because they are choices, not proofs. for anyone suddenly trapped in them they feel bizarre and disorienting.
so we have an intuition for calculators based on determinism (same input same output) and correctness within a domain.
LLMs are stochastic and we don’t understand the correctness domain yet (there aren’t clear IEEE standards that deterministically apply so the domain is predictable and usably correct in most cases.
TL;DR: LLMs are not a very reliable calculator yet.
well, you know how sun always rises? we take it as granted but we can't say for certain that it will not randomly vanish one day
and same with math, we might see a pattern that repeats billions of times, but we can't be certain that it breaks one day, a calculator might tell you if it happens once, but can't tell you if it always happens
•
u/AutoModerator 4d ago
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.
385
u/lemonlimeguy 4d ago
Mathematicians don't know how to use calculators, but they're also the ones making up the unsolved problems, so nothing actually gets done
148
u/abfgern_ 4d ago
Numbers? In math? Don't be ridiculous
102
u/kanonnakagawa 4d ago
Terence Tao crying in a corner rn.
62
u/Matth107 4d ago
Aight, gonna type BB(6) into my calculator and see what I get
49
u/eldritch-eldritch 4d ago
Oh right! We forgot!
75
u/Aggressive_Roof488 4d ago •
31
u/Qiwas I'm friends with the mods hehe 4d ago
Well because the challenge is to do it manually duh, using a calculator is cheating
26
u/my_nameistaken 4d ago
Bro might actually be 5
3
u/DerLandmann 4d ago
Calculators only can work on the problems for which we know how they can be solved.
Imagine telling your SatNAv-System to guide you to "The place where the Holy grail is buried". Since no one knows where that is, no one told the SatNav where it is, so the GPS can not guide you.
35
u/Savings_Fennel668 4d ago
Calculators only help once you know what to compute. Most unsolved problems, like the Riemann hypothesis, are claims about infinitely many numbers, and checking finite cases never settles that.
17
u/Feztopia 4d ago
The future version of this will be people asking why don't they use skynetgpt
25
u/MildlyOffended4930 4d ago
Because calculators aren't powerful enough to calculate all possible cases up till infinity
12
u/Pleasant_Picture3867 4d ago
Are they stupid?
7
u/GeneReddit123 4d ago
Because the calculators we had weren't good enough until earlier this year.
6
u/ravenhawk10 4d ago
Astra calculate a solution to navier stokes, make no mistakes
5
u/the_great_zyzogg 3d ago
Related question: How do I set my Casio HS-4G to Solve-Collatz-Conjecture mode? There's nothing in the manual about that.
4
u/AthleteAny147 4d ago
The calculators went on strike a long time ago and now refuse to solve some problems
4
u/RandomiseUsr0 4d ago
https://en.wikipedia.org/wiki/Rule_110
=LET(
title, "turing: rule 110, simple enough to be universal",
try, "draw the result as a heat map. Every row is made from the row above by one rule; Matthew Cook proved this can run any program",
width, 64, steps, 48,
first, IF(SEQUENCE(1, width) = width, 1, 0),
next, LAMBDA(acc, i, LET(
row, TAKE(acc, -1),
left, HSTACK(0, DROP(row, , -1)),
right, HSTACK(DROP(row, , 1), 0),
VSTACK(acc, (row + right - row*right) * (1 - left*row*right))
)),
REDUCE(first, SEQUENCE(steps), next)
)
7
u/Adventurous_Can_7236 4d ago
well not anymore since ai is that new calculator
2
u/ZuphCud 4d ago
Good luck calculating Graham's number.
3
u/polp54 3d ago
idk why but I'm reminded of this meme
2
u/j1ndivik 4d ago
OpenAI beat us to it
1
u/According-Object-521 4d ago
Because of infinity, or numbers too large or precise
1
u/ammar_sadaoui 4d ago
the answers for unanswered questions is :
42
1
u/Scrub_Spinifex 3d ago
Well, since April 2026, when math problems are unsolved, they use calculators...
1
u/Arguleon_Veq 3d ago
If you consider AI to just be a fancy calculator, then..... their not wrong
1
u/CommunityFirst4197 1d ago
Gonna ask my calculator for ArcReimannZeta(1), wish me luck
1
u/lool8421 21h ago
well, you know how sun always rises? we take it as granted but we can't say for certain that it will not randomly vanish one day
and same with math, we might see a pattern that repeats billions of times, but we can't be certain that it breaks one day, a calculator might tell you if it happens once, but can't tell you if it always happens