Documente Academic
Documente Profesional
Documente Cultură
Seun Adedokun
I. INTRODUCTION
A. Logical Analysis
From the notion of effective calculability For a method
to be effective calculable some important criteria must be
analyzed which I have analyzed and included in the logic
analysis The method should have a finite number of exact
finite instructions For a case where I want to apply the
logical method for the analysis the algorithm I am using for
the logic analysis will finish after a finite number of steps
The algorithm method should produce a correct answer I
can evaluate the outcome of the algorithm I am using even
without any aids this condition is quite important as I can
use it as check on the algorithm iteration The algorithm may
be very intricate but it can be understandable in simple terms
I analyze the case where the algorithm does not return an
answer where the domain of expected algorithm output is
outside the domain of analysis this is quite important as a
case where n which is for example the number of iteration
is quite large
B. Boolean Satisfiability
Boolean Satisfiability I analyze the concept of Boolean
satisfiability problem which I am using to solve the P versus
NP Problem the boolean satisfiability problem is the problem
of determining if there exists an interpretation that satisfies
a given boolean formula therefore it asks if the variables of
a given boolean formula can be consistently replaced by the
values true or false such that the formula evaluates to true If
the formula evaluates to true then it is satisfiable but if false
it is unsatisfiable for example the logical and statement a and
not b where for values of a=true and b-false the logical and
statement a and not b evaluates to true but the logical and
statement a and not a where for values of a=true and b-false
the logical and statement a and not a evaluates to false
C. Automated Theorem Proving
Automated theorem proving is the field of automated reasoning and mathematical logic where I can prove mathematical theorems by computer programs For propositional logic
the concept of deciding the validity of a formula depends on
the logical analysis involved the logical analysis I have used
for the solution methodology of the Hasse weil conjecture
and the Birch and swinnerton conjecture is computationally
feasible in polynomial time because I can easily explain the
birch and swinnerton conjecture logically as a 3 Sat problem
and I have formulated an algorithm to prove its Boolean Satisfiability called the Seun Adedokun Polynomial Algorithm
I have confirmed that the Seun Adedokun Polynomial Algorithm satisfies the Godels completeness theorem The Godels
completeness theorem is a fundamental in mathematical logic
that establishes a correspondence between semantic truth and
syntactic provability in first order logic I have formulated
the Seun Adedokun Polynomial Algorithm and the algorithm
satisfies the Godels completeness theorem it should be noted
that a first order formula is logically valid if it is true in every
structure for the language of the formula where the language
of the formula in this case means for any assignment of
values to the variables of the formula The Seun Adedokun
Polynomial algorithm that I propose is logically valid I will
provide more details on this in manuccript 2 For the Seun
Adedokun Polynomial Algorithm I have also being able to
define a deductive system for the completeness theorem and I
have confimed that the deductive system is complete because
I have confirmed that the logically valid formula I am
using is the conlusion of a formal logical deductive system
and the completeness theorem for a particular deductive
system is the theorem that it is complete in this sense Even
though I can say the Seun Adedokun Polynomial Algorithm
satisfies the Godels Completeness theorem I hereby say with
certainty that I disagree with Godels incompleteness theorem
which states that no consistent system of axioms whose
theorems can be listed by an effective procedure is capable
of proving all truths about the arithmetic of the natural
numbers I will provide more details on this in manuscript
2 I will also provide more detailed solution analysis on
the Halting problem I stand to correct the notion by Alan
turing that a general algorithm to solve the halting program
G. Computational Complexity
The time complexity of an algorithm quantifies the amount
of time taken by an algorithm to run as a function of the
length of the string representing the input which is expressed
as the big O notation the time complexity is said to be
described asymptotically as the input size goes to infinity
for example if the time required by an algorithm on inputs
of size n is at most 5n3 + 4n the asymptotic time complexity
is O(n3 )
The worst case time complexity can be used to measure an
algorithms performance time which may vary with different
inputs of the same size denoted by T (n) an algorithm with
O(n) is called a linear time algorithm and an algorithm with
T (n) = O(M n )andM n = O(T (n)) for Mn1 is said to be
an exponential time algorithm For a constant time complexity
analysis the running time T (n) is O(1) for a logarithmic
time complexity analysis the running time is O(logn) For a
linear time complexity analysis the running time is O(n) For
an exponential time complexity analysis the running time is
2( poly(n)) 2n 2( n2 ) For an exponential time with linear exponent the running time is 2( O(n))11n 10n For a polynomial
time the running time is 2( O(log(n))) = poly(n)nnlognn1 0
Polynomial algorithm problems are algorithm problems for
which a deterministic polynomial time algorithm exists and
belong to the complexity class P Exponential time algorithm
problems are problems which admits exponential time algorithms on a deterministic turing machine and they are
described by the complexity class EXP and described by
the function T (n) = 2( nc ) For a case where the exponent is
a linear function of n T (n) = 2( o(n)) this case is described
by the complexity class E
H. Consequences of the P versus NP
I will explain the practical consequences of the P versus
NP problem that I formulate in cryptography like the Public Key cryptography symmetric ciphers and cryptographic
hashing I will also explain the practical consequences in Operations research like some types of integer programming and
travelling salesman problem and some interesting application
like protein structure folding and practical consequences in
medicine
I am also solving the Karps 21 NP complete problems
like Satisfiability the 0 -1 integer programming the Clique
the Set Packing Vertex cover Set covering Feedback node
set Feedback arc set Directed Hamilton circuit Undirected
Hamilton circuit I am also solving the Satisfiability with at
most 3 literals per clause the chromatic number Clique cover
Exact cover Hitting set Steiner tree 3 dimensional matching
Knapsack Job sequency Partition and max cut problem
IV. CONCLUSIONS
This paper os manuscript 1 of my 30 manuscripts to the
solution that i formulate on P versus NP problem I solve the
P versus NP based on my analysis and solution of of the
boolean satisfiability criterion.
APPENDIX
Appendixes should appear before the acknowledgment.
ACKNOWLEDGMENT
The preferred spelling of the word acknowledgment in
America is without an e after the g. Avoid the stilted
expression, One of us (R. B. G.) thanks . . . Instead, try R. B.
G. thanks. Put sponsor acknowledgments in the unnumbered
footnote on the first page.
References are important to the reader; therefore, each
citation must be complete and correct. If at all possible,
references should be commonly available publications.
R EFERENCES
[1] The question on the Boolean Satisfiability criterion .