Any programming language could be considered Turing complete given enough memory. | Argüman

sender

elliottbelardo2

source

Unspecified

view

← ↑
↓ →

You can use arrow keys to navigate in the map.

Loading tree...

Any programming language could be considered Turing complete given enough memory.

however

score: 3

"Programming language" needs to be well-defined. Some people explicitly exclude languages that are not Turing-complete, in which case the statement is tautological.

sender:
collectedoverspread

2 years, 10 months ago

2 supporters.

 permalink
0 branch
‒

Neutral support and objection rate.

last update: collectedoverspread (2 years, 10 months ago)