I've almost solved the Collatz conjecture guys...

I've almost solved the Collatz conjecture guys. Just need a bit of help filling in the [math]\textsf{does_halt}[/math] function. any help? I'll give you co-author credits

Other urls found in this thread:

en.wikipedia.org/wiki/Hypercomputation
win.tue.nl/~gwoegi/P-versus-NP.htm
academia.edu/1595051/COLLATZ_CONJECTURE_PROOF?auto=download
twitter.com/NSFWRedditImage

It's implemented in almost every library, to an annoying degree. Christ, look up stack exchange or something before making a thread

>he doesn't use Haskell

Don't worry OP. I got the joke.

The rest of you should be ashamed of yourselves.

The joke just wasn't that funny

Gibe that sexy color scheme

Just a friendly remind that the halting problem can actually be solved if you move to a better model of computation than Turing machines.

They can solve the halting problem for Turing machines, but they can't solve their own version of the halting problem, not they probably also can't be physically realised

There's no better model of general computation.

go to r/unixporn and find the color scheme yourself

ehehehahheahgehghaeghsdagjhkajldfhadksj

just a friendly reminder that spouting bullshit like this is actually fucking harmful because idiots WILL think it's real

en.wikipedia.org/wiki/Hypercomputation

Too lazy.

>when someone is so pseudo-intellectual that he actually turns anti-intellectual
Ignorance and arrogance are a dangerous combination ....

t. pure mathematician

>a hypercomputer is a computer that can compute non-computable functions
literally a contradiction and completely useless

literally a semantic issue and completely irrelevant

>theoretical physicists literally get paid money to make up hypothetical spacetimes, in which to use hypothetical computers to solve hypothetical problems

And once again, we are pedantic and complain about non-rigorous English simplifications of subjects. This is the level of discourse in every math thread.

please tell me how the hypercomputer, which can "compute" the halting problem, solves the fundamental paradox associated to the halting problem.

and "computing" something that is not-computable isn't actually semantics, it literally doesnt make any goddamn sense.

Let infinite proper time pass for the turing machine and if it hasn't halted then it does not halt.

Just a sec OP, just running my exhaustive max BB states test, will let you know when I have the numbers and we'll just check if your program has reached the max amount of states

gruvbox

ok. I only have around 50 states, so I just need BBSHIFT(50), shouldn't be too bad.

>One letter variable names

I'll let you know when it's done bro, running it on an i7 so shouldnt be long

what would you prefer

can you ELIknow about turing machines? wikipedia is too advanced

>having such a weak mind that you need to give descriptive variable names

>Has never had to try and fix code written by the kind of person who uses meaningless variable names.

>not being able to infer the intention behind the code by reading and analyzing it.

brainlets really crack me up!

This may surprise you, but the CTO of most companies would much rather you do useful work than spend half a day 'inferring the intention behind the code by reading and analyzing' a bloated thousand line function you have to fix because the twat who wrote it and should be fixing it quit and buggered off to Australia.

Then fix the code and repost it, so we can all learn

Looks similar to the Firecode theme.

Or possibly the Upstream theme.

does_halt(x):
x();
return true;

>not being the CTO of a company

brainlets really crack me up!

jesus fucking christ this board is the worst

>not having already done collatzHalt() in JavaScript as practice
how can you ever design style sheets without knowing this suit geez

bumping for potential

Op what do you think about P versus NP?
win.tue.nl/~gwoegi/P-versus-NP.htm

pic unrelated

So, faggot, what is the theme?

I don't know enough to comment, but P=NP problem wouldn't really affect the halting problem

gruvbox

>not does_halt(checker, 0)
>(checker, 0)
>checker 0
>check y'er 0
>check your 0
>LOOK AT THE LAST DIGIT OF OP

I pull a goddamn fucking spideman and halt that trolley's ass.

Then I go hunt down the predictor, and duct tape his ass to a train track. For being such a fucking cunt.

and I can solve all world's resource problems using the Banach-Tarski paradox

OP what do you make of this proof claim?

academia.edu/1595051/COLLATZ_CONJECTURE_PROOF?auto=download

God damnit reply to this op

...

What really disturbs me about this shit is that I had these kind of thoughts as a child. It's exactly as formal, just let children play around on a wiki. No paycheck needed.