Hacker News Reader

In my opinion, it is very, very hard to fully sandbox a clever AI. It can find side channels, or it can turn innocuous stuff into computing device...

e.g: "Accidentally Turing complete" shows how things that were not intended to be computing devices are actually Turing complete. Including: Magic the gathering, the card game.

http://beza1e1.tuxen.de/articles/accidentally_turing_complet...

View on HN

I've often thought that JIRA workflows are Turing complete, I was hoping your list would have evidence.

It’s funny to think of JIRA as Turing complete because when using JIRA nobody can complete any programs.

Well, everything halts then, so that just solved the Halting Problem.

But you need to prove that it halted - to you manager obviously - that's the impossible and stressful part.

Need to explain it to 10 managers if you work in enterprise software.

But is it provable in nondeterministic polynomial stress?

Reply on news.ycombinator.com