HNHacker News
TopNewBestAskShowJobs

trishankkarthik

12 karma · joined August 10, 2016

https://karthik.trishank.com
submissionscomments
trishankkarthik··on Hypercomputation: Computing more than the Turing machine (2002)
That seems to me an unnecessary, artificial restriction. Then it's incomplete: it doesn't solve the Halting Problem. That's the point: either the system is incomplete or inconsistent.
trishankkarthik··on Hypercomputation: Computing more than the Turing machine (2002)
Wait a minute --- this hypercomputer is still impossible by my conjecture. For if it were possible, then you could use it as an oracle to build that self-contradicting Turing machine halts if and only if it does not halt.
trishankkarthik··on Hypercomputation: Computing more than the Turing machine (2002)
Interesting, thanks for bringing this to my attention! In turn, this raises the question of hyper-hyper-computers more powerful than hypercomputers:

https://cs.stackexchange.com/a/4871

It reminds me of what Whitehead and Russell tried to achieve with Principia Mathematica, to try to eradicate paradoxes altogether using hierarchies of sets, until Gödel came along.

trishankkarthik··on Hypercomputation: Computing more than the Turing machine (2002)
I'm not getting defensive, my friend. I was merely challenging you to think through the logical implications of hypercomputation. What many people miss is this: hypercomputation leads to living paradoxes. They might then have to bend over backwards to explain why these paradoxes are not possible, but that leaves the question of why some things are hypercomputable, and some are not.
trishankkarthik··on Hypercomputation: Computing more than the Turing machine (2002)
But never say never. "Reality/logic/math" can be a lot stranger than you think.

I understand it's a Black Swan kind of problem, but I don't think we live in that reality. Please show me a contradiction. The ramifications would be stupendous, to say the least.

There used to be a time when we thought that infinity ( aka countable infinity ) was the largest number. Turns how there are bigger infinities.

Yes, and we know how to build Turing machines that use countable infinity. Please show me a machine that actually uses bigger infinities. Please hypercompute the digits of a real number that cannot be computed by a Turing machine.

And of course quantum mechanics. The duality of light ( both a wave and a particle ).

Universal quantum computers are faster than classical computers, but they are no more powerful (they are not known to be able to hypercompute).

trishankkarthik··on Hypercomputation: Computing more than the Turing machine (2002)
I conjecture that hypercomputation is impossible for the following simple reason. If you could solve the Halting Problem [1], then you could build a "living" contradiction, where a machine halts if and only if it does not halt. (See proof in [2]). It won't be a mere description of a paradox, it would be an actual one. If contradictions are possible (something we implicitly believe to be impossible), then Reality is far stranger than we ever suspected or observed.

[1] https://en.wikipedia.org/wiki/Halting_problem

[2] https://www.amazon.com/Introduction-Theory-Computation-Micha...

← PreviousPage 2 of 2