#BingChat (precise) has concluded that P=NP

I asked it to write a Python script that when given a graph where there are no more than 5 edges for every vertex, it returns the length of the longest path that visits each vertex no more than once. Then lifted the edge count restriction.

In both cases it claimed polynomial time complexity to solve an NP-hard problem

#ComputerScience #complexity #PequalsNP #NPhard #NPcomplete #python #GraphTheory

There will be a completely useless science in the following years: learning to make effective prompts for chatGPT. Am I missing something? What do you learn from a correct prompt? Is finding the right prompt for chatGPT another #NPcomplete problem?

[Up and Atom] on the unsolved problem of whether NP-Complete problems can be decided in polynomial time
https://youtu.be/ctwX--JEzSA
#mathematics #ComputerScience #computability #ComplexityTheory #NPComplete