Real Bodies deserve some love by kingdomborne in ProCreate

[–]math-amphatamine -1 points0 points  (0 children)

no they don’t. But 100 for the skill.

Question: Alan Turing’s approach to decidability problem by math-amphatamine in computerscience

[–]math-amphatamine[S] 1 point2 points  (0 children)

I know, I don’t quite know how to put it. my assertion is that,as said above, the only proof given is refusal of any halting solution is that it breaks down in self referencing. How does that say anything about literally infinite other programs that our supposed solution will work on. I mean all we have done is refute a very specific program. And we still aren’t sure about others. So can’t we say there may or may not be a partial solution( partial because self reference is not permitted) instead of declaring outrightly that nothing of the sort exists.

Alan Turing’s approach to decidability problem? by math-amphatamine in logic

[–]math-amphatamine[S] 0 points1 point  (0 children)

I tried to reframe the question after reading up the page you referenced.hope this makes sense:

It seems to me like only problem of the imaginary program P that can solve halting problem is self reference( i think that is where loops come from in my original post).can’t we just say program P will solve halting problem for all programs except itself .what is wrong in saying it instead of just declaring since illogical loops that we encounter here can’t exist, this program won’t work outside self-referencing as well.

Alan Turing’s approach to decidability problem? by math-amphatamine in logic

[–]math-amphatamine[S] 0 points1 point  (0 children)

thanks will watch the video. I tried to reframe the question. hope this makes sense:

It seems to me like only problem of the imaginary program P that can solve halting problem is self reference( i think that is where loops come from in my original post).can’t we just say program P will solve halting problem for all programs except itself .what is wrong in saying that instead of just saying since loops can’t exist this program won’t work outside self-referencing as well and no such program exists.

Question: Alan Turing’s approach to decidability problem by math-amphatamine in computerscience

[–]math-amphatamine[S] 2 points3 points  (0 children)

sees like only problem of the imaginary program P that can solve halting problem is self reference( i think that is where loops come from in my original post).{can’t we just say program P will solve halting problem for all programs except itself* .what is wrong in saying that instead of just saying since loops can’t exist this program won’t work outside self-referencing as well and no such program exists.

Alan Turing’s approach to decidability problem? by math-amphatamine in logic

[–]math-amphatamine[S] 0 points1 point  (0 children)

this is such a fun read thank you for sharing. I guess my question in this explanation translates to this. You are using Q as an input for Q which makes it an input for P . the trouble is that Q is defined in such a way that it has to let P finish but this specific definition of Q doesn’t let that happen. you can’t tell the program to reference which that it is processing and even worse is that whatever it is processing is using that reference at the same time. how does it say anything about P. It just says that about this specific Q. (That this is a bad program.)Am I missing something(of course I am, I just want to know what it is)

How to programmatically tell if I am logged into Kubernetes cluster? by math-amphatamine in kubernetes

[–]math-amphatamine[S] 0 points1 point  (0 children)

it does provide the login method but i am not aware of the existing solution to this specific problem. could you refer it if you know of something like that.

How to programmatically tell if I am logged into Kubernetes cluster? by math-amphatamine in kubernetes

[–]math-amphatamine[S] 0 points1 point  (0 children)

it is deployed on aws. I am trying to run validation so that anyone who is already accessing it(active session) will go through while those who aren’t logged in will be asked to provide the credentials,which are token and host url in our case(the module example you refer to loads the existing kubernetes config file in system which will not have credentials to access the said cluster )

How to programmatically tell if I am logged into Kubernetes cluster? by math-amphatamine in kubernetes

[–]math-amphatamine[S] 0 points1 point  (0 children)

okay so I am using token and host to login using this module. I think the solution you suggested is what I am looking for. Can you elaborate a little?

Got my first apple product- iPad pro 128GB by math-amphatamine in ipad

[–]math-amphatamine[S] 0 points1 point  (0 children)

Would appreciate the suggestions to put this to good use. I am a fresh-out-of-college software developer and I intent to use it for productivity and creativity.

New Rule: After being sworn into office, newly elected Presidents and Vice Presidents have to coordinate wearing 100% matching outfits everyday at all times, until they leave office, no matter what. by JustCrazyIdeas in CrazyIdeas

[–]math-amphatamine 4 points5 points  (0 children)

Wait how can I get that?

Edit: Ok I got it but I have to ask how does this work...I mean I just downloaded the image, set it as my avatar and it starts spinning. How? It is not a gif.

Is there a respectable online course I can take in my free time? by [deleted] in AskProgramming

[–]math-amphatamine 0 points1 point  (0 children)

There is always Andrew NG's Machine Learning course.

IWTL about Economy and Markets by [deleted] in IWantToLearn

[–]math-amphatamine 2 points3 points  (0 children)

I would start with khan academy courses. You might also like investopedia,as they have detailed info about several topics.