Isn't Gödel's first incompleteness theorem a logic equivalent to the Entscheidungsproblem?The decision problem asks:Is there an algorithm which outputs the truth value of any logic statement universally?Gödel's first incompleteness theorem states that there is no complete logical system.As such, Assuming such an algorithm is founded upon any system of logic, then by Gödels thm, it cannot output the truth value of any logical statement universally.Was it truly such a leap for the Logicians of the time to make this connection between Gödel and the decision problem?Furthermore, in the "on computable numbers..." paper by Alan Turin, the paper which is usually cited as the solution to the Entscheidungsproblem:the argument used, the diagonalization argument, is the same argument used by Gödel in his proof. Just bloated beyond existence with Turin's horribly obfuscated constructions.Thoughts? Was Turin a government plant to push homosexuality onto the field of logic?
>>17001756typical gayician projecting, you're a fag, turin's a fag, logicians are and always will be arrogant, ignorant, nobody fags,
I'm a raging homosexual and therefore fully qualified to answer OP's question. Decidability is different from completeness and consistency. You're right though that Gödel basically cracked all the building blocks necessary. It wasn't Turing who was the first to prove the lack of decidability. Gödel went to America to give some lectures that Alonzo Church attended. Then, Church with his students published Lambda Calculus and the relevant proof. It was beautiful, pure math. Then the nigger faggot Turing copied it all, made an engineering version of it and got Church to be the professor for his thesis. Literally no-one cared about Turing until the British lost the war and had a huge minority complex. The British made up all kinds of dumb shit to boost national morale and basically rewrote history as if Turing was some genius homo even though he was just fake and gay.
>>17001756Incompleteness theorem is about extensions of PA (and other sufficiently powerful theories), Entscheidungsproblem is about general first-order validitity
It wasn't an "algorithm" (or "decision procedure") that could act as an automated judge for all mathematical proofs they should've been looking for. It was Tron
>>17003202>I'm a raging homosexual and therefore fully qualified to answer OP's question.not OP, but is it true that homos ruined homosexuality?
>>17001756kys homo
