allowing our "does it halt" function to specify conditions in the return value (it will halt ... if there is an even number over 2 which is not the sum of the prime numbers), instead of a mere boolean seems like a good idea
so i want O: given a program P, O returns a program Q that (when ran) tells me if P halts. if P is one of the
corner cases, i would imagine Q simply not halting (i'll just time it, it doesn't need to be perfectly accurate and i can keep track of the ones that need more investigation).
make me O or tell me why you can't do it. and remember: if a student would be able to prove something about P, i want O to be able to write me a program Q that tells me that.
anyway, my question for
>>1:
AAAAAAABBBBBBAAAAAAAAAAACCCCCCCCAAAAAAAAAAAAAABBBBBBAAAAA
BAAAAAAAAABBBBBBBBBBAAAAAAAAAAAAAAAAAABBBAAAAAAAAAAAABBBB
AAAAAAAABABAAAAAAAAAAAAABBBBBBBBAAAAAAAAACCCCCCCCCCCCCCBB
ABACCCCCCCCCCCAAAAAAAAAAAAAAAAAAABABABAAAAAAAAAAAAAAAAAAA
AAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA