this post was submitted on 27 Jan 2024
430 points (97.8% liked)

Memes

52069 readers
1456 users here now

Rules:

  1. Be civil and nice.
  2. Try not to excessively repost, as a rule of thumb, wait at least 2 months to do it if you have to.

founded 6 years ago
MODERATORS
[email protected]
[email protected]
[email protected]
[email protected]
430
The future is now, old man (lemmy.world)
submitted 2 years ago by [email protected] to c/[email protected]
16 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 32 points 2 years ago (5 children)

In short, everything that is Turing-conplete can compute anything.

[–] photonic_sorcerer 14 points 2 years ago* (last edited 2 years ago) (4 children)

Except for that which is non-computable.

[–] [email protected] 5 points 2 years ago (1 children)

New to me that there is proof that something is not computable.

[–] MacFearrs 17 points 2 years ago

The most obvious answer to this is the halting problem.

load more comments (2 replies)
load more comments (2 replies)