431

submitted 9 months ago by JokaJukka@lemmy.world to c/memes@lemmy.ml

15 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] ShortN0te@lemmy.ml 31 points 9 months ago

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

[-] photonic_sorcerer@lemmy.dbzer0.com 13 points 9 months ago* (last edited 9 months ago)

Except for that which is non-computable.

[-] ShortN0te@lemmy.ml 4 points 9 months ago

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

[-] MacFearrs@lemmy.dbzer0.com 17 points 9 months ago

The most obvious answer to this is the halting problem.

load more comments (2 replies)

this post was submitted on 27 Jan 2024

431 points (98.0% liked)

Memes

45602 readers

1072 users here now

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

founded 5 years ago

MODERATORS