Probabilistic Complexity Theory

#NPcompleteEqualsP, #NPNotEqualscoNP and #PNotEqualscoP!!! What is Non-deterministic is the Environment, and any NP problem can be P with the proper reduction of Uncertainty. With a (Knowledge) map climbing any unknown mountain is #NPEqualsP. Do you have the same probability of losing you than reaching the top with a (Knowledge) map? Of course not. #NPNotEqualscoNP What’s the probability of losing you … Continue reading Probabilistic Complexity Theory

Copy and paste this URL into your WordPress site to embed

Copy and paste this code into your site to embed