title: Intended infinite recursion, no-return functions
body: <p>Infinite recursion is most often not desired, and when it happens it usually causes a stack overflow or segfaults.</p>
  
  <p>But for theory's sake, and plain curiosity, I've been thinking if it'd be possible to create actual infinite recursion, intentionally.</p>
  
  <p>Working in C++ and C where the stack, usually, grows for each function call, and each function returns and pops the part of the stack it handled.</p>
  
  <p>Here's the thought. Would it be possible to force a function to clear out it's own stack space and then call another function so that the new function effectively replaces the first function, without the first function needing to return and then fire again via a loop.</p>
  
  <p>I'm not only thinking about plain loops as a possible use for this, if there would be any. Loops usually do a good job at what they do. But what if you were to use it for sending signals through a node network, that carry on indefinitely in their own process threads until they reach a certain condition. It <em>might</em> be a tool that could be used for some problems.</p>
  
  <p>Remember, I'm not really asking if it's practical, only if it's possible to do. For science!</p>