<s>
In	O
computer	O
programming	O
,	O
Walther	B-Algorithm
recursion	I-Algorithm
(	O
named	O
after	O
Christoph	O
Walther	O
)	O
is	O
a	O
method	O
of	O
analysing	O
recursive	O
functions	O
that	O
can	O
determine	O
if	O
the	O
function	O
is	O
definitely	O
terminating	B-Application
,	O
given	O
finite	O
inputs	O
.	O
</s>
<s>
It	O
allows	O
a	O
more	O
natural	O
style	O
of	O
expressing	O
computation	O
than	O
simply	O
using	O
primitive	B-Architecture
recursive	I-Architecture
functions	I-Architecture
.	O
</s>
<s>
Since	O
the	O
halting	O
problem	O
cannot	O
be	O
solved	O
in	O
general	O
,	O
there	O
must	O
still	O
be	O
programs	O
that	O
terminate	O
,	O
but	O
which	O
Walther	B-Algorithm
recursion	I-Algorithm
cannot	O
prove	O
to	O
terminate	O
.	O
</s>
<s>
Walther	B-Algorithm
recursion	I-Algorithm
may	O
be	O
used	O
in	O
total	B-Application
functional	I-Application
languages	I-Application
in	O
order	O
to	O
allow	O
a	O
more	O
liberal	O
style	O
of	O
showing	O
primitive	B-Architecture
recursion	I-Architecture
.	O
</s>
