Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Walther_recursion> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Walther_recursion abstract "In computer programming, Walther recursion (named after Christoph Walther) is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs. It allows a more natural style of expressing computation than simply using primitive recursive functions.Since the halting problem cannot be solved in general, there need to be still programs that will terminate, but which Walther recursion cannot prove to terminate. Walther recursion may be used in total functional languages in order to allow a more liberal style of showing primitive recursion.".
- Walther_recursion wikiPageExternalLink 31163520.pdf.
- Walther_recursion wikiPageExternalLink walther.ps.
- Walther_recursion wikiPageExternalLink On-proving-termination-AIJ-71-1_1994-2.pdf.
- Walther_recursion wikiPageExternalLink 978-3-540-61511-8.
- Walther_recursion wikiPageID "33068494".
- Walther_recursion wikiPageLength "2078".
- Walther_recursion wikiPageOutDegree "11".
- Walther_recursion wikiPageRevisionID "675284609".
- Walther_recursion wikiPageWikiLink Artificial_Intelligence_(journal).
- Walther_recursion wikiPageWikiLink BlooP_and_FlooP.
- Walther_recursion wikiPageWikiLink Category:Recursion.
- Walther_recursion wikiPageWikiLink Christoph_Walther.
- Walther_recursion wikiPageWikiLink Divergence_(computer_science).
- Walther_recursion wikiPageWikiLink Halting_problem.
- Walther_recursion wikiPageWikiLink Machine_that_always_halts.
- Walther_recursion wikiPageWikiLink Massachusetts_Institute_of_Technology.
- Walther_recursion wikiPageWikiLink Primitive_recursive_function.
- Walther_recursion wikiPageWikiLink Terminating.
- Walther_recursion wikiPageWikiLink Termination_analysis.
- Walther_recursion wikiPageWikiLink Total_Turing_machine.
- Walther_recursion wikiPageWikiLink Total_functional_programming.
- Walther_recursion wikiPageWikiLinkText "Walther recursion".
- Walther_recursion hasPhotoCollection Walther_recursion.
- Walther_recursion wikiPageUsesTemplate Template:Cite_conference.
- Walther_recursion wikiPageUsesTemplate Template:Cite_journal.
- Walther_recursion wikiPageUsesTemplate Template:Cite_thesis.
- Walther_recursion wikiPageUsesTemplate Template:Compu-prog-stub.
- Walther_recursion wikiPageUsesTemplate Template:Ref_improve.
- Walther_recursion subject Category:Recursion.
- Walther_recursion hypernym Method.
- Walther_recursion type Article.
- Walther_recursion type Software.
- Walther_recursion type Algorithm.
- Walther_recursion type Article.
- Walther_recursion comment "In computer programming, Walther recursion (named after Christoph Walther) is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs. It allows a more natural style of expressing computation than simply using primitive recursive functions.Since the halting problem cannot be solved in general, there need to be still programs that will terminate, but which Walther recursion cannot prove to terminate.".
- Walther_recursion label "Walther recursion".
- Walther_recursion sameAs m.0h5603l.
- Walther_recursion sameAs Q7966682.
- Walther_recursion sameAs Q7966682.
- Walther_recursion wasDerivedFrom Walther_recursion?oldid=675284609.
- Walther_recursion isPrimaryTopicOf Walther_recursion.