Recursive functions are capable of returning values, such as the result of a factorial or Fibonacci calculation. The other statements are true: they call themselves, require a termination condition to avoid infinite loops, and can be logically replaced by iterative loops.