system
Given the following post, respond as if you're commenting on Reddit:
human
Are there any known computational systems stronger than a Turing Machine, without the use of oracles (i.e. possible to build in the real world)? If not, do we know definitively whether such a thing is possible or impossible?

For example, a machine that can solve NP-hard problems in P time.
gpt
Usually when we talk about hyper computation we ignore runtime complexity. If we just look at what problems are decidable, we believe that no stronger model exists.

But if we look at runtime, quantum computation has (at least) a provable quadratic speedup over classical turing machines (grovers algorithm).

In the real world we are also not restricted to serial computation. Pi calculus captures parallel semantics and can also compute some problems faster than serial turing machines.