title: Stack overflows from deep recursion in Java?
body: <p>After some experience with functional languages, I'm starting to use recursion more in Java - But the language seems to have a relatively shallow call stack of about 1000.</p>
  
  <p>Is there a way to make the call stack bigger? Like can I make functions that are millions of calls deep, like in Erlang?</p>
  
  <p>I'm noticing this more and more when I do Project Euler problems.</p>
  
  <p>Thanks.</p>