With 1.7 million freelancers, we'll match you with the perfect talent.
The client has made the following changes to the job.
Client prefers freelancers from:
You are still able to submit a proposal for this job.
The client prefers freelancers from
a different location.
The halting problem of Turing is famous because it was one of the first problems proven algorithmically undecidable. This means there is no algorithm which can be applied to any arbitrary program and input to decide whether the program stops when run with that input.
I need an above average mathematics/physics academic which will act as a co-author of an academic paper to disprove Turing’s halting proof wrong for random outcomes. I have the idea and concept and research done and need the mathematics to be done. This will attract a huge amount of interest in the academic world.
I need a fixed budgeted amount for the project and payments to be done on milestone achievements. This will not be long project as all the evidence to disprove the proof of Turing is done.
Sign in or Register to see more