Re:Malbolge (programming language)
by sp332 on Wednesday May 30, 2012 @11:15AM
(#4043168)
The only reason it's technically not Turing-complete is because of its limited memory. The Malbolge Unshackled variant has unlimited memory and is Turing-complete.
[ Parent
| on HN ]
There are no comments on this comment yet.