Viewing profile — scapp

That's a different meaning of the word "undecidable". You're talking about undecidable problems [1]. The meaning in Gödel's incompleteness theorem is different and is a synonym wit…

Hmmm, it could definitely be clearer. It looks like it's using the bulk density for "sugar" (so including the air between the crystals) and the actual density for "sucrose".

It's somewhat a coincidence. In the paper, the dimension has to be larger than this constant K which is shown to be no larger than 1728. This is a fairly crude estimate that comes …

This is the easiest of the paradoxes mentioned in this thread to explain. I want to emphasize that this proof uses the technique of "Assume P, derive contradiction, therefore not P…

M.A. was the highest degree available in the UK at the time [1]. The closest equivalent to a PhD program might be the Prize Fellowship that Hardy had from 1900 to 1906, though it's…

Nothing wrong with starting at 1 for induction, but yes, having an additive monoid is nice (still get a multiplicative monoid with N*)

*Bill Odenkirk. Bob is his brother

Nice! I wondered if someone would beat that TAS level anyway.

It's easy to find the UUID associated to a nickname. For example, here's [0] the one for `accrual` [0] https://namemc.com/profile/Accrual.1

It's always fun to make fun of cranks. Thanks for linking that. The author really needs to find the right statement of what they call the Nested Interval Theorem. I cracked up at t…

Kind of disappointing that it doesn't have the victory screen. But man, my fingers still remember that combo you have to do for those 4 wide areas.

2 line explanation of where e comes from here: to represent a number x in base b, you need roughly log_b(x) digits. If you weight that by the number of different digits in base b, …

> Last time I checked there was still no formal version of Cantor's diagonalization argument. Formalization? Like a computer checked proof? Lean: https://leanprover-community.githu…

Check out the replies to this comment [1] with the same attempted counterexample. Your set isn't union closed because {1}U{2} = {1, 2} isn't in it (same for {1}U{3} etc.). [1] http…

There's a way to make it always appear above other windows. Let me see if I can find that again... Ah, it's in the options menu on the task manager itself (alt + O to access the me…

I don't see the problem. For example, if something finishes in 10 minutes, it has 6 completions per hour. If a competitor finishes in 1 minute, it has 60 completions per hour. It b…

> along with the other axioms the the theory is derived from Axioms are trivially provable in any system. Unless you mean prove them without using them, in which case you're actual…

> the unnameable reals, which are almost every real Is there a definition you have in mind for "unnameable"? If you mean definable [0][1], then this is independent of ZFC. The "sta…

It's because the cone cells connected to those variants of colorblindness have very similar sensitivities to wavelengths. Check out this diagram: https://en.wikipedia.org/wiki/Cone…

Spaces like this (manifolds) are usually classified by which Euclidean space they look like locally. So, for example, the surface of a sphere is two-dimensional since it locally lo…

Maybe it's changed now, but the "π" in the title is unicode U+03C0 [0], which is a lowercase pi. In the font Verdana (the one that I see in the title, but not this comment as I typ…

Does this project still exist somewhere other than Google Code? It seems everything on the website 404s. EDIT: this might be it: https://github.com/Tipoca/intuitionistic

The better term to use here is Socratic dialogue [0]. [0] https://en.wikipedia.org/wiki/Socratic_dialogue

First, a point of terminology: uncountably infinite refers to any infinite cardinality other than countably infinite, so if the number of probability distributions is at least the …

Wait, is there something wrong with the paper you linked? Theorem 1.1 says > There is an integer multiplication algorithm achieving M(n) = O(n log n). You don't call something a th…