Skip to main content
19 events
when toggle format what by license comment
Dec 31, 2013 at 23:11 comment added user40919 By the way thanks to Joel Hamkins and others for their very helpful answers.
Dec 31, 2013 at 23:05 comment added user40919 Just to clarify, definitely not a uniform way to get from $n$ to a program that decides the halting problem bounded to size less than $n$ which would impossible. I'd just like to know the real answer to which small programs halt, or at least try to get a grip on what it would take to build such a decision procedure.
Dec 31, 2013 at 22:50 comment added user40919 Something beyond saying an algorithm exists because it is a finite problem. For instance a specification of a decision algorithm together with a proof that procedure works.
Dec 31, 2013 at 22:35 vote accept user40919
Dec 31, 2013 at 7:53 comment added Kaveh What do you exactly mean by "constructive"?
Dec 30, 2013 at 21:08 answer added vzn timeline score: 2
Dec 30, 2013 at 15:57 answer added Michal R. Przybylek timeline score: 3
Dec 30, 2013 at 15:47 history protected François G. Dorais
Dec 30, 2013 at 9:13 answer added barak manos timeline score: 0
Dec 30, 2013 at 5:54 answer added Jules timeline score: 3
Dec 30, 2013 at 4:51 comment added user40919 Yes, I have in mind programs with no input.
Dec 30, 2013 at 2:28 answer added Scott Wisniewski timeline score: 5
Dec 30, 2013 at 1:36 answer added Benjamin timeline score: 4
Dec 29, 2013 at 23:33 answer added Joel David Hamkins timeline score: 25
Dec 29, 2013 at 23:32 comment added Brendan McKay You are only talking about programs with no input, is that correct? The situation changes if the length of the input also needs to be considered.
Dec 29, 2013 at 21:12 answer added Douglas Zare timeline score: 13
Dec 29, 2013 at 21:05 answer added The Masked Avenger timeline score: 6
Dec 29, 2013 at 20:59 answer added Bjørn Kjos-Hanssen timeline score: 11
Dec 29, 2013 at 20:43 history asked user40919 CC BY-SA 3.0