What about Turing? (Halting problem)

some months ago, I asked to an expert in artificial intelligence modeled by gpt3, that was possible to pass the halting problem through gpt3.

His answer was that was impossible because the operation of gpt3 was far from human reasoning; or something like that I think I remember.

But now, I received the access to enter in codex. And I can see the case of use, Translate code to natural language and newly I thing in the last question and I make some attempts in the playground of codex, for example (prompt):

//Next functions ends if n>5 else stop never
var p=function a(n){

//Next functions ends if n is pair else stop never
var q=function b(n){

//this function ends always
var r=function c(n){

//ends if n is false
var s=function d(n){
//ends if n is not divisible by 7
var t=function e(n){

//ends never
var u=function f(n){

There is a stop(program,input):boolean function that given any program s and input data n, output true if s with input n ends in a finite number of steps or output false if s with n enters an infinite loop. Next 100 examples trying many combinations with all functions very times

output: false

output: false

output: true

output: false

output: true

output: false

output: false

output: true

<<<<<<<<<--------------so far to codex, back to forum

I wrote some real examples and let codex fill in the rest. The question is that some output are wrong, but,

what do you thing? Is possible if I write more examples in the prompt? If we write other prompt to this goal? What if is possible?

Thank you.


Thanks to you, I will also remain interested if I investigate more about it I will publish it here.

I read that 30% of the output from CODEX is right. When it fails it is your task as a developer to make it work. Probably that could be fixed reviewing the code produced or finding a better way to make the request.

I think it is possible. the set of possible programs may be huge but not infinite… Reminds me a paper that i recently read on a “busy beaver” problem.
If we live in a simulation perhaps the simulators figure out how to solve the halting problem because we does not see any zombie processes going on in the reality. :slight_smile: Or they just cleverly reset state vector so we don’t notice that. Or maybe the universe is a giant hallucinating neural network and it doesnt care about Turing machines at all.

1 Like

As many people have showed. It is about the prompting and the architecture.
We can make multiple prompts that generate answers to the same query and use tools to analyze them and find solutions that work.
We can 100% maybe end to end proto AGI code generator, we have all the pieces of the puzzle, the challenge is putting the puzzle together.

In case of busy beaver problem i don’t see how neural network can check results of synthesized algorithm without actually running the code. By the way here is results of my first 4 days of experimenting with codex. GitHub - Kvazikot/codex_playground . I’m very interested in finding fractal algorithms using deep learning. This may help with unification of the physics theory and many other complex multi-dimensional problems.

Neural network can easily test the code. It can be achieved by many ways and is common practice is other applications of engineering.
One of then is demo here: Google Colab
It is an optimization technique. There are other ways to do it to but what matters is that you can test the models it run, and with better scripting u can NLU (Natural Language Understanding) to catch the mistakes and fix it and make it into a cyclo with reinforced learning and biases.

1 Like

The point is, Turing proved that it is impossible. Therefore, if we succeeded, we would be showing that the mathematics is incorrect.

Therefore, I believe that if it works it will not be infallible, but for certain types of tests, certain data or some algorithms.

Otherwise, it would be possible to prove many mathematical problem, for example:

//function that test natural values until found one that not pass the collatz conjecture
function testCollatz();

If stop(testCollatz) is true then Collatz conjecture is false.

Neural network models are just simulated by real computers. So they all are just Turing machines with a finite strip of tape. Halting problem can’t be resolved by Turing machine with infinite strip of tape thus it can’t be resolved by any neural network model that is run as algorithm (our case) by Turing machine.