this post was submitted on 22 Jun 2022
6 points (100.0% liked)
Asklemmy
43898 readers
929 users here now
A loosely moderated place to ask open-ended questions
If your post meets the following criteria, it's welcome here!
- Open-ended question
- Not offensive: at this point, we do not have the bandwidth to moderate overtly political discussions. Assume best intent and be excellent to each other.
- Not regarding using or support for Lemmy: context, see the list of support communities and tools for finding communities below
- Not ad nauseam inducing: please make sure it is a question that would be new to most members
- An actual topic of discussion
Looking for support?
Looking for a community?
- Lemmyverse: community search
- sub.rehab: maps old subreddits to fediverse options, marks official as such
- !lemmy411@lemmy.ca: a community for finding communities
~Icon~ ~by~ ~@Double_A@discuss.tchncs.de~
founded 5 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
In math:
Whether an algorithm run on a Turing machine will halt.
It's also known that there are true mathematical statements, than can never be proven. As in, they are definitely true, but we will never rigorously know for sure.
https://yewtu.be/watch?v=HeQX2HjkcNo
Yup, and that's a direct side effect of Gödel's incompleteness theorems.