|
|
|
|
|
|
by rowanG077
1077 days ago
|
|
|
I don't even think that Turing completeness and expressive power are linked at all. You could easily imagine a language like haskell without general recursion or inductive date types. It's still much, much more expressive then C, but without the Turing completeness. Expressive power to me is something akin to "how easy is it to express a problem as close as possible to it's natural state in a PL". |
|
|