Jump to content

HarounBoutamani

Members
  • Posts

    12
  • Joined

  • Last visited

Profile Information

  • Favorite Area of Science
    Mathematics

HarounBoutamani's Achievements

Quark

Quark (2/13)

0

Reputation

  1. I have answered some questions that were previously posted, and I am willing to answer other questions, but I don't promise that I will answer every word directed to me.
  2. I answer questions that I judge to be interesting enough, and I did. I suppose you have the moderator permissions to close the thread.
  3. Except for an algorithm that does not exist. This may be great as I may not have to answer anymore of your questions.
  4. This exactly my point when I say that uncountable variables are an area of research for me. Compa(p) and Order(P) may be uncountable but they are comparable, and they can be involved in calculus, how far can this go, I don't know yet.
  5. I think you may consider set theory from a selectivity perspective, or not.
  6. What I am referring to is that we can't tell the number of their respective elements, being infinite sets.
  7. Order(P) and Order(NP) are the number of elements of P and NP respectively, Order(P) and Order(NP) are uncountable variables but they are still comparable to the elementary properties of their respective elements. For example let's define for the class P the relation R-comptability (L,K)- > { L and K have polynomial relation between their expressed complexities.} For any element p out of P we have : Compa(p) = Order(P) - 1 and Incompa(p) = 0. Let's define the same relation R-comptability defined previously but for the class NP. For any element n out of NP we have: Compa(n) < Order(NP) - 1 and Incompa(n) > 0 This question of yours brings me to the subject of uncountable variables, which is a subject of research for me. Regarding the notational question of x|y, it means x is different from y. About uncountable variables, I believe the number of steps necessary to solve an NP-Hard problem to be an uncountable variable, but this is yet to be proved.
  8. I point out that the paper title is "Selectivity in sets and duality P vs NP". Minor changes in latest version. Selectivity in sets and the duality P vs NP.pdf
  9. In infinite sets the number of elements may not be countable but I consider it a variable.
  10. I don't have to define every selective function.
  11. I have uploaded the file in case the link isn't working. Selective Incompatibility and an approach to the duality P vs NP.pdf
  12. Hello, Here I share with you a paper I wrote on Selective Incompatibility in sets and an approach to the duality P vs NP. Paper link : https://­drive.google.com/­file/d/­0B2iY_1VArjmYTUttR1h5­WTRIWDg/­view?usp=drivesdk Regards
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.