Decidability/Undecidability of feasibility of optimization problems












0












$begingroup$


I build "on top of" the posts "Is the feasibility of a system of non-convex quadratic equations and inequations decidable?" and "Is the first-order theory (with =) of real numbers with addition and multiplication complete and decidable?" My understanding is that all coefficients in question can be algebraic numbers. Question: Can the coefficients be replaced by computable real numbers? I doubt that this is the case because algebraic numbers can be specified with polynomial equalities and inequalities whereas (I think), general non-computable reals cannot. However, my knowledge is lacking and I'd be thankful for an answer.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    If you are going to reference other posts, you should link to them. You can use the linked chain icon in the posting box, but I prefer the simpler syntax [ visible text ](address)
    $endgroup$
    – Paul Sinclair
    Feb 2 at 16:43
















0












$begingroup$


I build "on top of" the posts "Is the feasibility of a system of non-convex quadratic equations and inequations decidable?" and "Is the first-order theory (with =) of real numbers with addition and multiplication complete and decidable?" My understanding is that all coefficients in question can be algebraic numbers. Question: Can the coefficients be replaced by computable real numbers? I doubt that this is the case because algebraic numbers can be specified with polynomial equalities and inequalities whereas (I think), general non-computable reals cannot. However, my knowledge is lacking and I'd be thankful for an answer.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    If you are going to reference other posts, you should link to them. You can use the linked chain icon in the posting box, but I prefer the simpler syntax [ visible text ](address)
    $endgroup$
    – Paul Sinclair
    Feb 2 at 16:43














0












0








0





$begingroup$


I build "on top of" the posts "Is the feasibility of a system of non-convex quadratic equations and inequations decidable?" and "Is the first-order theory (with =) of real numbers with addition and multiplication complete and decidable?" My understanding is that all coefficients in question can be algebraic numbers. Question: Can the coefficients be replaced by computable real numbers? I doubt that this is the case because algebraic numbers can be specified with polynomial equalities and inequalities whereas (I think), general non-computable reals cannot. However, my knowledge is lacking and I'd be thankful for an answer.










share|cite|improve this question











$endgroup$




I build "on top of" the posts "Is the feasibility of a system of non-convex quadratic equations and inequations decidable?" and "Is the first-order theory (with =) of real numbers with addition and multiplication complete and decidable?" My understanding is that all coefficients in question can be algebraic numbers. Question: Can the coefficients be replaced by computable real numbers? I doubt that this is the case because algebraic numbers can be specified with polynomial equalities and inequalities whereas (I think), general non-computable reals cannot. However, my knowledge is lacking and I'd be thankful for an answer.







logic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 2 at 4:14







Mukul Agarwal

















asked Feb 2 at 3:55









Mukul AgarwalMukul Agarwal

186




186








  • 1




    $begingroup$
    If you are going to reference other posts, you should link to them. You can use the linked chain icon in the posting box, but I prefer the simpler syntax [ visible text ](address)
    $endgroup$
    – Paul Sinclair
    Feb 2 at 16:43














  • 1




    $begingroup$
    If you are going to reference other posts, you should link to them. You can use the linked chain icon in the posting box, but I prefer the simpler syntax [ visible text ](address)
    $endgroup$
    – Paul Sinclair
    Feb 2 at 16:43








1




1




$begingroup$
If you are going to reference other posts, you should link to them. You can use the linked chain icon in the posting box, but I prefer the simpler syntax [ visible text ](address)
$endgroup$
– Paul Sinclair
Feb 2 at 16:43




$begingroup$
If you are going to reference other posts, you should link to them. You can use the linked chain icon in the posting box, but I prefer the simpler syntax [ visible text ](address)
$endgroup$
– Paul Sinclair
Feb 2 at 16:43










0






active

oldest

votes












Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
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%2fmath.stackexchange.com%2fquestions%2f3097011%2fdecidability-undecidability-of-feasibility-of-optimization-problems%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3097011%2fdecidability-undecidability-of-feasibility-of-optimization-problems%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

SQL update select statement

WPF add header to Image with URL pettitions [duplicate]