409 reputation
515
bio website turkistany.blogspot.com
location Makkah, Saudi Arabia
age 45
visits member for 4 years, 10 months
seen 1 hour ago

Wild Florida Gator living in Arabia

Mohammad Al-Turkistany, Ph.D. in Computer Engineering, University of Florida

Assistant Professor of Computer Engineering, Umm Al-Qura University, Makkah, Saudi Arabia

"The reasonable man adapts himself to the world; the unreasonable persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable".

George Bernard Shaw

"You can't turn mince back into meat by rotating the mincer's handle in the opposite direction"


Jun
14
revised Analogue break down between complexity theory and computability theory
added 57 characters in body
Jun
14
revised Analogue break down between complexity theory and computability theory
added 57 characters in body
Jun
14
revised Analogue break down between complexity theory and computability theory
deleted 2 characters in body
Jun
14
asked Analogue break down between complexity theory and computability theory
Jun
4
comment Is there a program for theory of incompleteness in NP?
@WillSawin What is the strongest known complexity theoretic assumption?
Jun
4
revised Is there a program for theory of incompleteness in NP?
added 345 characters in body
May
17
awarded  Yearling
May
17
comment Is there a program for theory of incompleteness in NP?
If $A$ is an incomplete set in $NP$ then the complement of $A$ is incomplete in $coNP$.
May
16
revised Is there a program for theory of incompleteness in NP?
edited tags
May
16
revised Is there a program for theory of incompleteness in NP?
added 178 characters in body
May
16
asked Is there a program for theory of incompleteness in NP?
Mar
20
comment Connection between Barnette conjecture and hardness of cubic graph decomposition
thank you. Do you have a link for the second reference?
Mar
19
revised Connection between Barnette conjecture and hardness of cubic graph decomposition
added 265 characters in body
Mar
19
asked Connection between Barnette conjecture and hardness of cubic graph decomposition
Jan
10
awarded  Popular Question
Jan
6
awarded  Quorum
Jan
3
comment Evidence that Graph Isomorphism problem is not $NP$-complete
@GerryMyerson I think stating that GI is "longest standing" is not accurate. I have edited the post accordingly.
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
added 8 characters in body
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
added 198 characters in body
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
added 33 characters in body