No Stupid Questions

914 readers

1 users here now

There are no stupid questions.

Follow site rules.

Don't be a fascist.

founded 5 years ago

MODERATORS

penloy@lemmy.ml

Is there an equivalent to being "Turing complete" in human languages? (lemmy.ml)

submitted 4 months ago* (last edited 4 months ago) by HiddenLayer555@lemmy.ml to c/nostupidquestions@lemmy.ml

3 comments fedilink hide all child comments

If a programming language is Turing complete, it means that you can write any algorithm in it and basically do everything that the computer is capable of doing, barring things like the process not having the privilege to access the APIs for doing something.

Is there an equivalent concept in language languages? Something like the ability to write down instructions for doing everything a human can do?

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

[–] Flyberius@hexbear.net 2 points 4 months ago

Interesting concept. I reckon there are very few that are not complete though