How to Think about Parallel Programming: Not! - Guy Steele [2011] Computer Science

How to Think about Parallel Programming: Not! - Guy Steele [2011]
Restricting the Halting problem to programs smaller than the halting function itself
What logic system(s) are used for the side of formal proof calculi in the Curry–Howard correspondence?
How to do different types of educational programs assignment
R vs SPSS Which One is The Best Statistical Language - Statanalytica
Tableau vs Qlikview | Which is The Best Data Analytics Tool - Statanalytica
Please Help me with my survey

How to Think about Parallel Programming: Not! - Guy Steele [2011]

Posted: 06 Sep 2020 11:19 PM PDT

submitted by /u/agumonkey
[link] [comments]

Restricting the Halting problem to programs smaller than the halting function itself

Posted: 06 Sep 2020 09:46 PM PDT

So, the standard proof of why the halting problem is not decidable involves attempting to decide if the halting function halts on itself. That's a pretty contrived case so I was thinking about various ways to restrict the question to see if it's still undecidable.

So I stumbled across this idea of the halting-less-than-N problem where the question is whether a program of size less than N will halt. (I assume someone has a name for it but I couldn't find it.) So obviously, a function that computes halting-less-than-N would need to be at least of size N. Otherwise, the standard proof works.

I think I was able to prove that at least one of the two following statements is true:

There is some N for which halting-less-than-N is undecidable.
There is some N for which whether a function computes halting-less-than-N is undecidable.

The basic idea is that if 1 and 2 are false, then for any program P of size N, I can iterate through all programs of size greater than N until I find halting-less-than-N, run halting-less-than-N on P and return that result. That program decides the halting question, so at least 1 or 2 is wrong.

I'd like to know if there is a name for that restriction of the halting problem, if the proof sketch I gave above makes sense (for my own benefit) and if it's correct if it's known whether the halting-less-than-N problem is decidable for all Ns. (I would be surprised.)

submitted by /u/AlexandreZani
[link] [comments]

What logic system(s) are used for the side of formal proof calculi in the Curry–Howard correspondence?

Posted: 06 Sep 2020 11:01 AM PDT

submitted by /u/timlee126
[link] [comments]

How to do different types of educational programs assignment

Posted: 07 Sep 2020 02:34 AM PDT

submitted by /u/codeavail_expert
[link] [comments]

R vs SPSS Which One is The Best Statistical Language - Statanalytica

Posted: 07 Sep 2020 03:20 AM PDT

submitted by /u/Matlabguru
[link] [comments]

Tableau vs Qlikview | Which is The Best Data Analytics Tool - Statanalytica

Posted: 07 Sep 2020 01:14 AM PDT