this post was submitted on 27 Jan 2024
432 points (98.0% liked)

Memes

51447 readers
1425 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
gary_host_laptop@lemmy.ml
sexy_peach@feddit.de
cyclohexane@lemmy.ml
cypherpunks@lemmy.ml
432
The future is now, old man (lemmy.world)
submitted 1 year 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 1 year ago (5 children)

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

[–] photonic_sorcerer@lemmy.dbzer0.com 13 points 1 year ago* (last edited 1 year ago) (4 children)

Except for that which is non-computable.

[–] ShortN0te@lemmy.ml 4 points 1 year ago (1 children)

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

[–] MacFearrs@lemmy.dbzer0.com 17 points 1 year ago

The most obvious answer to this is the halting problem.

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