4 edited tags
| link
    Tweeted twitter.com/#!/StackCompSci/status/187115798626709505
3 edited tags; edited title
| link

Are there minimum criteria for a programming language being Turing completenesscomplete?

2 deleted 9 characters in body
source | link

Does there exist a set of computations that need to be performableprogramming language constructs in a programming language in order for it to be considered Turing Complete?

From what I can tell from wikipedia, the language needs to support recursion, or, seemingly, must be able to run without halting. Is this all there is to it?

Does there exist a set of computations that need to be performable in a programming language in order for it to be considered Turing Complete?

From what I can tell from wikipedia, the language needs to support recursion, or, seemingly, must be able to run without halting. Is this all there is to it?

Does there exist a set of programming language constructs in a programming language in order for it to be considered Turing Complete?

From what I can tell from wikipedia, the language needs to support recursion, or, seemingly, must be able to run without halting. Is this all there is to it?

1
source | link