Is the description of the mechanism that implements the solution suitable as a P=NP solution? Or is it necessary to make an algorithm?

Question

Algorithms

There is a mechanism that implements a solution to any sat problem (not tested live).
There is a mechanism that solves the factorization problem (only when n is formed by two primes), it works, and so far it does not allow you to quickly factorize large numbers (or I think it does not) - but it is very descriptive.

Answer 1

Not