P vs. NP,algorithm

Multi tool use
Multi tool use

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
4
down vote

favorite












Is there a known, explicit example of an algortihm with the property such that if $Pneq NP$ then this algorithm doesn't run in polynomial time and if $P=NP$ then it does run in polynomial time?






ds.algorithms np p-vs-np







share|cite|improve this question

















  • 1




    Sort of. If P = NP, Levin’s universal search algorithm runs in polynomial time on accepting instances en.wikipedia.org/wiki/…
    – Emil Jeřábek
    2 hours ago














up vote
4
down vote

favorite












Is there a known, explicit example of an algortihm with the property such that if $Pneq NP$ then this algorithm doesn't run in polynomial time and if $P=NP$ then it does run in polynomial time?






ds.algorithms np p-vs-np







share|cite|improve this question

















  • 1




    Sort of. If P = NP, Levin’s universal search algorithm runs in polynomial time on accepting instances en.wikipedia.org/wiki/…
    – Emil Jeřábek
    2 hours ago












up vote
4
down vote

favorite









up vote
4
down vote

favorite











Is there a known, explicit example of an algortihm with the property such that if $Pneq NP$ then this algorithm doesn't run in polynomial time and if $P=NP$ then it does run in polynomial time?






ds.algorithms np p-vs-np







share|cite|improve this question













Is there a known, explicit example of an algortihm with the property such that if $Pneq NP$ then this algorithm doesn't run in polynomial time and if $P=NP$ then it does run in polynomial time?






ds.algorithms np p-vs-np




ds.algorithms np p-vs-np






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 3 hours ago









user2925716

1375




1375







  • 1




    Sort of. If P = NP, Levin’s universal search algorithm runs in polynomial time on accepting instances en.wikipedia.org/wiki/…
    – Emil Jeřábek
    2 hours ago












  • 1




    Sort of. If P = NP, Levin’s universal search algorithm runs in polynomial time on accepting instances en.wikipedia.org/wiki/…
    – Emil Jeřábek
    2 hours ago







1




1




Sort of. If P = NP, Levin’s universal search algorithm runs in polynomial time on accepting instances en.wikipedia.org/wiki/…
– Emil Jeřábek
2 hours ago




Sort of. If P = NP, Levin’s universal search algorithm runs in polynomial time on accepting instances en.wikipedia.org/wiki/…
– Emil Jeřábek
2 hours ago










1 Answer
1






active

oldest

votes

















up vote
3
down vote



accepted










If you assume that $P=^?NP$ is provable in PA (or ZFC), a trivial example is the following:



Input: N (integer in binary format)
For I = 1 to N do
begin
 if I is a valid encoding of a proof of P = NP in PA (or ZFC)
 then halt and accept
End
Reject





share|cite|improve this answer






















  • How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
    – user2925716
    2 hours ago










  • @user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
    – Marzio De Biasi
    1 hour ago










Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "114"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcstheory.stackexchange.com%2fquestions%2f41751%2fp-vs-np-algorithm%23new-answer', 'question_page');

);

Post as a guest

















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
3
down vote



accepted










If you assume that $P=^?NP$ is provable in PA (or ZFC), a trivial example is the following:



Input: N (integer in binary format)
For I = 1 to N do
begin
 if I is a valid encoding of a proof of P = NP in PA (or ZFC)
 then halt and accept
End
Reject





share|cite|improve this answer






















  • How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
    – user2925716
    2 hours ago










  • @user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
    – Marzio De Biasi
    1 hour ago














up vote
3
down vote



accepted










If you assume that $P=^?NP$ is provable in PA (or ZFC), a trivial example is the following:



Input: N (integer in binary format)
For I = 1 to N do
begin
 if I is a valid encoding of a proof of P = NP in PA (or ZFC)
 then halt and accept
End
Reject





share|cite|improve this answer






















  • How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
    – user2925716
    2 hours ago










  • @user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
    – Marzio De Biasi
    1 hour ago












up vote
3
down vote



accepted







up vote
3
down vote



accepted






If you assume that $P=^?NP$ is provable in PA (or ZFC), a trivial example is the following:



Input: N (integer in binary format)
For I = 1 to N do
begin
 if I is a valid encoding of a proof of P = NP in PA (or ZFC)
 then halt and accept
End
Reject





share|cite|improve this answer














If you assume that $P=^?NP$ is provable in PA (or ZFC), a trivial example is the following:



Input: N (integer in binary format)
For I = 1 to N do
begin
 if I is a valid encoding of a proof of P = NP in PA (or ZFC)
 then halt and accept
End
Reject






share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 8 mins ago

























answered 2 hours ago









Marzio De Biasi

18k240108




18k240108











  • How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
    – user2925716
    2 hours ago










  • @user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
    – Marzio De Biasi
    1 hour ago
















  • How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
    – user2925716
    2 hours ago










  • @user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
    – Marzio De Biasi
    1 hour ago















How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
– user2925716
2 hours ago




How do I quicly decide if "I is a valid encoding of a proof of P = NP in PA (or ZFC)" ?
– user2925716
2 hours ago












@user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
– Marzio De Biasi
1 hour ago




@user2925716 You can do it in polynomial time (imagine that $I$ is a string that represents the full proof in any reasonable deduction system).
– Marzio De Biasi
1 hour ago

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcstheory.stackexchange.com%2fquestions%2f41751%2fp-vs-np-algorithm%23new-answer', 'question_page');

);

Post as a guest
































































UhwPNtDfV9mMr,8sPQxUu77,Du8kGUUAIFo9 nR,M2aNFowHYECL,pXxQT
-
JLykpCCLXZR6,cBJ w4tGnXt,GdQJQXub a8 QXD33v,y Js2W 3,jqz7R87W6EqYkJDrhJGS

Popular posts from this blog

How to check contact read email or not when send email to Individual?

Image
Clash Royale CLAN TAG #URR8PPP up vote 1 down vote favorite I'm using WordPress 4.9.8, CiviCRM to 5.5.1, I usually send email to contact by Search> Find contacts View contact details Action> Send email Send email ok, Contact received mail ok like picture But status only Email sent though contact read email or not. So, can CiviCRM can change status to Email read when contact read email? wordpress email share | improve this question asked Sep 26 at 0:12 ToanLuong 49 9 add a comment  |  up vote 1 down vote favorite I'm using WordPress 4.9.8, CiviCRM to 5.5.1, I usually send email to contact by Search> Find contacts View contact details Action> Send email Send email ok, Contact received mail ok like picture But status only Email sent though contact read email or not. So, can CiviCRM can change status to Email read when contact read email? wordpress email share | improve this questi...
Read more

How many registers does an x86_64 CPU actually have?

Image
Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite I am currently learning reverse engineering and am studying the flags register. I had in my mind that rflags was just another name for one of the 16 general purpose registers, for example rax or rbx . But it looks like rflags is actually an additional register. So that makes 17 registers in total... how many more could there be? I have spent at least an hour on this and found numerous different answers. The best answer so far is this, which says that there are 40 registers in total. 16 General Purpose Registers 2 Status Registers 6 Code Segment Registers 16 SSE Registers 8 FPU/MMX Registers But if I add that up, I get 48. Could anybody provide an official answer on how many registers an x86_64 CPU has (e.g. an Intel i7). Additionally, I have seen references to 'hardware' and 'architectural' registers. What are those registers and how many are there? register x86-64 share | improve this...
Read more

Displaying single band from multi-band raster using QGIS

Image
Clash Royale CLAN TAG #URR8PPP 1 How can I extract a single band from multi-band raster in QGIS? I have an remote sensed image which has 6 bands (including NDVI band), I want to display each band separately, but have no idea how to do. I have seen some questions similar here but none worked for me. The original image (has 6 bands) is: I want to display the band 6 which should be like this: But I tried gdal_translate, and couldn't get the correct result. What I have got is: qgis raster multi-band share | improve this question edited Mar 5 at 0:53 Summer asked Mar 4 at 6:42 Summer Summer 23 6 Is this any help gis.stackexchange.com/questions/220658/… ? if not gis.stackexchange.com/questions/62133/… might help. – Michael Stimson Mar 4 at 6:46 Thanks for answering but when I used gdal_translate, qgis showed that 'Error 4: Kayena.tif: No such file or directory". Would you know how to fi...
Read more