In a notorious text from the Tractatus 3.333 Wittgenstein argues that a function that has a value in one argument cannot be re-used in a another. Hence recursive functions are meaningless. This touches on his attitude to Godel and Russell.
It is not a criticism of recursion theory and recursive definitions [by the way, recursion theory originated in the 1930s while the Tractatus was written during the first world war and was first published in German in 1921. And also, in 1921 Kurt Gödel was only fifteen years old: he published his doctoral dissertation, where he established the completeness of the first-order predicate calculus, in 1929].
The context is R&W theory of types. See:
3.331 From this observation we turn to Russell’s ‘theory of types’. It can be seen that Russell must be wrong, because he had to mention the meaning of signs when establishing the rules for them.
3.332 No proposition can make a statement about itself, because a propositional sign cannot be contained in itself (that is the whole of the ‘theory of types’).
Thus, 3.333 must be read in this context:
The reason why a function cannot be its own argument is that the sign for a function already contains the prototype of its argument, and it cannot contain itself.
What Wittgenstein is discussing is the basics of formal syntax: an expression has specific rules that must be followed in using the expression to build up a complex one.
Thus, e.g. a function symbol F(x) must be "completed" (saturated) with a term symbol (a "name") in order to get a meaningful sentence: F(a).
The expression F(F) is syntactically wrong-written (not well-formed) and thus meaningless.
We may compare it with Categorial grammar :
a family of formalisms in natural language syntax motivated by the principle of compositionality and organized according to the view that syntactic constituents should generally combine as functions or according to a function-argument relationship.
This is not the way recursion works. In a recursive definition we use the value of a function F for e.g. an argument n to compute the value of F for the argument n+1.