Open Issues Need Help
View All on GitHubAI Summary: The task involves proving the non-polynomial time complexity of a novel "NP-Computer" implemented using graph 3-colorability. This requires designing a non-polynomial time function (likely utilizing the computer's 'FIND' operation) that determines graph 3-colorability and demonstrating that the computer's execution time exceeds the function's complexity, thus proving the computer's non-polynomial nature. The solution needs to leverage the provided project's architecture and functionalities (BREAK, FIND, etc.) and potentially extend it to handle n-colorability for n > 3.
This is a repo to show how the 3 coloring problem can be used as a computer. From here we can see that since computation isn't polynomial time the 3 coloring problem is not polynomial.