Skip to main content

Questions tagged [computer-science]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
25 votes
4 answers

Is there a linguistics equivalent to Turing completeness?

In computer science, programming languages can be described in terms of "Turing completeness", basically, whether a programming language is capable of expressing any* algorithm. A non-Turing-complete ...
TheEnvironmentalist's user avatar
2 votes
2 answers

Any difference between natural and programming languages?

First of all, as a native German speaker, I apologise for my incorrect use of the English language. After thinking about some different languages and wandering astray on this exact Stack Exchange, I ...
ThreeFx's user avatar
  • 147
10 votes
6 answers

Does the P versus NP conjecture in computer science have any direct relevance to linguistics?

From Wikipedia: The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be ...
EsperantoSpeaker1's user avatar
6 votes
2 answers

Can we simulate the pronunciation of sounds that we can't make?

There's certain non-filled places in the IPA chart because we physically can't pronounce them. For example, a velar trill or glottal trill. Using computers, is it possible that we could simulate how ...
Featherball's user avatar
0 votes
3 answers

Natural languages, programming languages, and information theory

The background The use of the context-free grammars in linguistics often prompts comparison with programming languages (e.g., see this question). Despite the formal structure similarities, I would ...
Roger V.'s user avatar
  • 980