TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ordinals aren't much worse than Quaternions

62 点作者 philzook9 个月前

7 条评论

jhanschoo9 个月前
&gt; I don’t really know how to work with the definition of ordinal arithmetic in terms of successors and limits.<p>What a shame... I think the dude is overcomplicating stuff just by not understanding this.<p>As an analogy, the naturals are the closure of 0 being a natural number, and to each natural number, having a function that gives you another number not in the set, as the &quot;next&quot; natural number (called the successor of that original number).<p>The class of ordinals are just the closure of having 0 be an ordinal, and to each *set* of ordinals being able to get the &quot;next&quot; ordinal, (i.e. the smallest ordinal that comes (not necessarily immediately) after all elements in the set). Then omega is the &quot;next&quot; ordinal wrt the natural numbers (aka finite ordinals), and that&#x27;s what&#x27;s meant by a limit ordinal, defined by exclusion, as not the &quot;next&quot; ordinal of any set of ordinals that has a maximum element (the natural numbers have no maximum element, but the natural numbers and omega together have omega as the maximum element); the &quot;next&quot; ordinal of a set that has a maximum element is equally the &quot;next&quot; ordinal of the set containing just that maximum element, and we can do a +1, just as with natural numbers, hence we call it successor ordinal.
评论 #41325957 未加载
评论 #41330348 未加载
Xcelerate9 个月前
The frequency illusion is funny—I just learned about the ordinals and now I’m seeing articles pop up about them everywhere.<p>It’s only mentioned briefly in a footnote in the article, but one of the most mind-blowing concepts related to ordinals is called the Goldstein sequences.<p>These are basically sequences that start at an arbitrary natural number n and follow some simple rules (like the Collatz conjecture) to go from one item in a Goodstein sequence to the next. Much like the sequences in the Collatz conjecture, the Goodstein sequences can reach incredibly (extraordinarily) high numbers before eventually coming back down and terminating at zero. However, unlike the Collatz conjecture, the statement that all Goodstein sequences eventually terminate at zero for any starting value n has been proven.<p>But here’s the remarkable part: the proof that all sequences eventually terminate requires axioms “beyond” what you think of as involved in standard arithmetic. Specifically, we require the ordinals and transfinite induction to prove that all sequences terminate (i.e., there is a proof that Peano Arithmetic cannot prove that all sequences terminate; ZFC can however).<p>What this means is that you can create an extraordinarily tiny Turing machine (or a Python script that’s about 10 lines of code) whose halting behavior requires these bizarre axioms that most non-mathematicians have never heard of to prove. That is just nuts to me for some reason.
评论 #41332360 未加载
评论 #41329350 未加载
AeZ1E9 个月前
inf(1) wow! ordinals are way cooler mathematical objects than i thought! i thought they were just for nerds but it turns out they are actually fascinating! what a mathematical rollercoaster!
评论 #41322367 未加载
Mathnerd3149 个月前
Surreal arithmetic is much nicer than ordinal arithmetic, it is commutative for example. I&#x27;ve always thought that a surreal number library supporting infinite numbers would be useful. Surreal numbers include ordinals but a lot more, they are the largest totally ordered field.<p>The only library I know of that supports infinite surreal numbers is CGSuite, you can see its hierarchy here: <a href="https:&#x2F;&#x2F;github.com&#x2F;aaron-siegel&#x2F;cgsuite&#x2F;blob&#x2F;e909ab8bc330e39bc837d26b22bc8a96f9fa512a&#x2F;lib&#x2F;core&#x2F;src&#x2F;main&#x2F;resources&#x2F;org&#x2F;cgsuite&#x2F;help&#x2F;docs&#x2F;tutorials&#x2F;advanced-topics&#x2F;normal-values.cgsh">https:&#x2F;&#x2F;github.com&#x2F;aaron-siegel&#x2F;cgsuite&#x2F;blob&#x2F;e909ab8bc330e39...</a>
skybrian9 个月前
Are there any software applications for ordinals?
评论 #41325613 未加载
评论 #41325268 未加载
评论 #41325429 未加载
ComplexSystems9 个月前
What on Earth is happening at the end of this article? I feel like I&#x27;m reading an AI-generated text from a pre-GPT-2 model. For instance:<p>&quot;Order summation. Disjoint sum of underling sets and the sayeverything in Right is greater than everything in Left. This shows the composition of two prcoesses is terminating.<p>Lexiocgraphic product. Tuple of underlying sets. Nesting of two terminating properties is terminating. How do I square that this feels like two nested for loops with lex being part of ackermann termination also?&quot;<p>I thought this was an article, and then it turned into a bunch of word salad esque personal notes...?
评论 #41325687 未加载
评论 #41324929 未加载
评论 #41324956 未加载
评论 #41324980 未加载
评论 #41324989 未加载
extrememacaroni9 个月前
I love how the farther you get itno teh artclie teh wores the spellnig mitsakse ar. It does feel like going in depth into something.
评论 #41325539 未加载
评论 #41325583 未加载
评论 #41325600 未加载