#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

Dinosaur Comics board on my office door yesterday with a rare combo-joke from both courses I'm teaching this term and the last topics we were discussing in each. #computersciencejoks #machinelearningjoks #chatgpt #pequalsnp

Oh, polynomial3sat.org is down and the respective code on GitHub is removed. The corresponding paper on arXiv is still accessible. Does anyone know more about what happened?

https://arxiv.org/abs/1903.10081

#satsolving #complexitytheory #PequalsNP #compsci #theoreticalcomputerscience