4 ms·

Interesting thought. Perhaps we'll discover a language that is in some way of higher order than Turing complete.

• Zambyte 2y ago
  There are certain concurrent properties that cannot be modeled with a Turing machine: https://en.wikipedia.org/wiki/Unbounded_nondeterminism https://en.wikipedia.org/wiki/Unbounded_nondeterminism There is also a very interesting intersection between the history of the Actor Model and Lambda Calculus: https://research.scheme.org/lambda-papers/ https://research.scheme.org/lambda-papers/
• mindcrime 2y ago
  > Interesting thought. Perhaps we'll discover a language that is in some way of higher order than Turing complete. See also: https://en.wikipedia.org/wiki/Hypercomputation https://en.wikipedia.org/wiki/Hypercomputation https://en.wikipedia.org/wiki/Limits_of_computation https://en.wikipedia.org/wiki/Limits_of_computation