Hacker Read top | best | new | newcomments | leaders | about | bookmarklet login

No, it really can’t. Unless you mean it in a sense that Minecraft is a Turing complete machine and can compute anything you want it to compute. Good luck computing anything non trivial.


sort by: page size:

Of course it can, just like a Turing machine can simulate itself.

It's more or less an feat in problem solving. Given a specific set of limitations in simulation, can you recreate and solve this computation problem?

For some games, like Minecraft (redstone) and Factorio (logic gates) it's easy, but for others it's difficult enough that you get to see some creativity. This is one of those latter instances.


It probably can, but it won't run in polynomial time.

With all due respect, it would be very hard for me to believe so. For the simplest case, one can trivially create a Turing machine that simulates a CPU, so I’m not sure the digital computation holds any water.

Of course it can given the correct framework. I think that's more a limitation of the structure of its interface and programming around it. Allow it to consider and iterate on its own output and it'll get there.


It written in Java, so while not impossible, I'd say unlikely.

I mean, if it can be specified by a computational process, that’s trivially true, right?

Can't it all be done computationally?

It can, but it’ll become something complex and Turing-complete like LaTeX.

Certainly. It does compute and without computation property it will be not possible to store and retrieve information.

Scaling would be quite difficult. I'm sure you could hack maybe a Turing machine out of this paradigm, but it would be ugly and mostly an esoteric exercise.

What else would it be but computation? Coming up with something that isn't computation in some form or other is exceedingly hard. I'm not even sure it's meaningfully possible.

Given infinite time and computing power, yes.

Not if you implement your own integers ;)


Cellular automata are turing complete, so in principle you can implement any algorithm if you control the start state (albeit with massive overhead).

So probably the answer is technically yes, but probably not in the way you are thinking of.


I doubt it. It’s too damn costly computationally.

No, it can't. FHE cannot emulate the whole MOV, especially the features that make it Turing-complete.
next

Legal | privacy