Logarithmic SAT Solution with Membrane Computing
Round 1
Reviewer 1 Report
I think the paper is clearly hard-worked, and that the results are sound with respect to the model used. Therefore, I think that the paper is publishable in its current state.
Reviewer 2 Report
The paper gives a novel and interesting computational (formal) solution to the SAT problem by using cP (compound P) cells as basic units of computation. The key element in the solution is the set of rules for parallel evaluation in constant time of the complete tree of potential solutions. This, combined with an O(log n) procedure for building the tree, gives an overall complexity of O(log n), significantly lower that the previous O(sqrt(n)).
The paper is clearly organized, with examples that explain the syntax and computational expressibility of the system. The proofs are correct, as far as I could follow them, and the main result emerges clearly from the supporting results. The paper is valuable, contains no flaws or errors, and is significant. I recommend its publication in its current form.
