gottheUIblues

7 ms·

1.
by gottheUIblues 8d ago
That was exactly my thought - taking out the problems that PhDs and early stage researchers work on kills the pipeline of developing mathematicians
2.
by gottheUIblues 10d ago
It's an article written by a guest contributor - not an editorial written as the voice of the newspaper
3.
by gottheUIblues 19d ago
Is the word "nonautological" autological ?
4.
by gottheUIblues 1mo ago
This is only the "problem solving" side of mathematics. Completely missing the theory builders who have completely reshaped the world of mathematics (and far beyond). AI is a long way from matching original thinkers of the calibr
5.
by gottheUIblues 4mo ago
The normal term for the logic that has two truth values, the law of non-contradiction, and the law of the excluded middle is 'Classical Logic' which dates back centuries before George Boole. Non-classical logics which deny one or
6.
by gottheUIblues 5mo ago
Rather COBOL is a living fossil? And today's Fortran is the FORTRAN family with horizontal gene transfer from the Algol lineage of programming languages.
7.
by gottheUIblues 5mo ago
Err? Peano Arithmetic is provably consistent in ZFC, but it is not in itself (if PA is consistent). Therefore if PA is consistent it is not equivalent to ZFC (regardless of whether ZFC is consistent or not)
8.
by gottheUIblues 6mo ago
"Embarrassingly" considered harmful?
9.
by gottheUIblues 6mo ago
To the contrary (as summarised by Gemini): Gödel showed that arithmetic cannot prove everything about itself. Turing showed that computers cannot predict everything about themselves. Rice showed that we cannot automatically verify what prog
10.
by gottheUIblues 6mo ago
I don't think of 9 as really being a signal to the process at all, more of an instruction to the OS kernel to terminate the process
11.
by gottheUIblues 6mo ago
If that theory holds - have to ensure that the models have not been trained on any code that is licensed incompatibly with the GPL, in which case the models could not be distributed at all
12.
by gottheUIblues 6mo ago
So specified .. that it can actually prove it can't be completely specified by any single specification
13.
by gottheUIblues 6mo ago
Right so strictly speaking C++ could do anything here when passed a null pointer, because even though assert terminates the program, the C++ compiler cannot see that, and there is then undefined behaviour in that case
14.
by gottheUIblues 6mo ago
Shouldn't that be the "dam spelling" then?
15.
by gottheUIblues 6mo ago
Film score composers are quite famous for borrowing from 12 tone serialism - quite a bit of discussion on it available by Googling or using your favourite chatbot
16.
by gottheUIblues 6mo ago
Money is a social construct, not some kind of physical quantity subject to conservation laws, and can be and is introduced into the economic system all the time. The real question is really would introducing more money or a UBI cause social
17.
by gottheUIblues 6mo ago
A trit is log(3)/(8log(2))=0.19812031259014 of a byte
18.
by gottheUIblues 7mo ago
The verifier doesn't need to be deterministic, just to output a proof artifact that can be independently validated for correctness.
19.
by gottheUIblues 7mo ago
There are infinitely many different p-adic completions of the rationals for each prime p, so we have 2-adics, 3-adics, 5-adics etc, all different.
20.
by gottheUIblues 7mo ago
It's topography not topology! Would be funny if a country has a government department dedicated to the mathematical field of topology!
21.
by gottheUIblues 9mo ago
Except protium, deuterium and tritium
22.
by gottheUIblues 9mo ago
Netscape open sourced to try and head off Internet Explorer as a 'last throw of the dice'? Chrome based originally on WebKit from Safari which was forked off KHTML from KDE's konqueror, came along years later.
23.
by gottheUIblues 10mo ago
I wrote as my comment kind of as a rhetorical question, but perhaps in retrospect the connection between the string comparison problem the pigeonhole principle is not so surprising in the end.
24.
by gottheUIblues 10mo ago
I didn't know and not mentioned in the article is that there are two different programs in reverse mathematics, one relating to classical mathematics, the other relating to complexity questions. Claude says this: not sure about accurac
25.
by gottheUIblues 10mo ago
And there's no clever trick you can do using eg hash functions or compression to shortcut the process? Of course the proofs that hash functions have collisions and there is no universal compression algorithm use the pigeonhole principl