To know whether a course in a hypertext will halt, it is necessary to know whether recursive functions are involved in the choosen algorithm, which is still an unsolved mathematics problem to me.
Recursive functions and loops are equivalent in expression; any expression involving loops can be written using recursion, and vice versa. Thus the termination of recursive expressions are also undecidable in general. Most recursive expressions found in common usage (ie. not pathological) can be shown to terminate through various means, usually depending on the definition of the expression itself.
Download ebooks on http://www.frenchtheory.com/
See that post with different algorithms in metabole
See the journal French Metablog with today different posts
Recursive functions and loops are equivalent in expression; any expression involving loops can be written using recursion, and vice versa. Thus the termination of recursive expressions are also undecidable in general. Most recursive expressions found in common usage (ie. not pathological) can be shown to terminate through various means, usually depending on the definition of the expression itself.
Download ebooks on http://www.frenchtheory.com/
See that post with different algorithms in metabole
See the journal French Metablog with today different posts
No comments:
Post a Comment