Re: Every sufficiently competent C programmer knows --- posthumous reviewers

On 2025-03-14 14:39:30 +0000, olcott said:

On 3/14/2025 4:03 AM, Mikko wrote:

On 2025-03-13 20:56:22 +0000, olcott said:
 

On 3/13/2025 4:22 AM, Mikko wrote:

On 2025-03-13 00:36:04 +0000, olcott said:
 

 void DDD()
{
   HHH(DDD);
   return;
}
 int DD()
{
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
 When HHH correctly emulates N steps of the
above functions none of them can possibly reach
their own "return" instruction and terminate normally.

 Nevertheless, assuming HHH is a decider, Infinite_Loop and Infinite_Recursion
specify a non-terminating behaviour, DDD specifies a terminating behaviour

 _DDD()
[00002172] 55         push ebp      ; housekeeping
[00002173] 8bec       mov  ebp,esp  ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404     add  esp,+04
[00002182] 5d         pop  ebp
[00002183] c3         ret
Size in bytes:(0018) [00002183]
 What is the sequence of machine language
instructions of DDD emulated by HHH such that DDD
reaches its machine address 00002183?

 Irrelevant off-topic distraction.

 Proving that you don't have a clue that Rice's Theorem
is anchored in the behavior that its finite string input
specifies. The depth of your knowledge is memorizing
quotes from textbooks.

Another irrelevant off-topic distraction, this time involving
a false claim.
One can be a competent C programmer without knowing anyting about Rice's
Theorem.
Rice's Theorem is about semantic properties in general, not just behaviours.
The unsolvability of the halting problem is just a special case.
Memorizing quotes from textbooks is useful for practical purposes but
if it is too hard for you there are other ways.
--
Mikko