CINXE.COM

<!DOCTYPE html PUBLIC "-//WAPFORUM//DTD XHTML Mobile 1.0//EN" "http://www.wapforum.org/DTD/xhtml-mobile10.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en-SG"><head><meta content="application/xhtml+xml; charset=UTF-8" http-equiv="Content-Type"/><meta content="no-cache" name="Cache-Control"/><title>define:Recursive Functional Algorithmic Language - Google Search</title><style>a{text-decoration:none;color:inherit}a:hover{text-decoration:underline}a img{border:0}body{font-family:arial,sans-serif;padding:8px;margin:0 auto;max-width:700px;min-width:240px;}.FbhRzb{border-left:thin solid #dadce0;border-right:thin solid #dadce0;border-top:thin solid #dadce0;height:40px;overflow:hidden}.n692Zd{margin-bottom:10px}.cvifge{height:40px;border-spacing:0}.QvGUP{height:40px;padding:0 8px 0 8px;vertical-align:top}.O4cRJf{height:40px;width:100%;padding:0;padding-right:16px}.O1ePr{height:40px;padding:0;vertical-align:top}.kgJEQe{height:36px;width:98px;vertical-align:top;margin-top:4px}.lXLRf{vertical-align:top}.MhzMZd{border:0;vertical-align:middle;font-size:14px;height:40px;padding:0;width:100%;padding-left:16px}.xB0fq{height:40px;border:none;font-size:14px;background-color:#1a73e8;color:#fff;padding:0 16px;margin:0;vertical-align:top;cursor:pointer}.xB0fq:focus{border:1px solid #1a73e8}.M7pB2{border:thin solid #dadce0;margin:0 0 3px 0;font-size:13px;font-weight:500;height:40px}.euZec{width:100%;height:40px;text-align:center;border-spacing:0}table.euZec td{padding:0;width:25%}.QIqI7{display:inline-block;padding-top:4px;font-weight:bold;color:#4285f4}.EY24We{border-bottom:2px solid #4285f4}.CsQyDc{display:inline-block;color:#70757a}.TuS8Ad{font-size:14px}.HddGcc{padding:8px;color:#70757a}.dzp8ae{font-weight:bold;color:#3c4043}.rEM8G{color:#70757a}.bookcf{table-layout:fixed;width:100%;border-spacing:0}.InWNIe{text-align:center}.uZgmoc{border:thin solid #dadce0;color:#70757a;font-size:14px;text-align:center;table-layout:fixed;width:100%}.frGj1b{display:block;padding:12px 0 12px 0;width:100%}.BnJWBc{text-align:center;padding:6px 0 13px 0;height:35px}</style></head><body><style>.ezO2md{border:thin solid #dadce0;padding:12px 16px 12px 16px;margin-bottom:10px;font-family:arial,sans-serif}.lIMUZd{font-family:arial,sans-serif}.synv3b{padding-bottom:12px}.FYYwXe{padding-bottom:12px}.oO6lG{padding-top:12px}.LUX65{overflow:hidden;text-align:center}.DT7Nxc{margin:0 auto;display:block}.HeLCGb{margin:0 -50%;display:inline-block}.CSfvHb{padding-bottom:8px}.fYyStc{word-break:break-word}.ynsChf{display:block;white-space:nowrap;overflow:hidden;text-overflow:ellipsis}.Fj3V3b{color:#1967d2;font-size:14px;line-height:20px}.FrIlee{color:#202124;font-size:13px;line-height:20px}.F9iS2e{color:#70757a;font-size:13px;line-height:20px}.WMQ2Le{color:#70757a;font-size:12px;line-height:16px}.x3G5ab{color:#202124;font-size:18px;line-height:24px}.fuLhoc{color:#1967d2;font-size:18px;line-height:24px}.epoveb{font-size:32px;line-height:40px;font-weight:400;color:#202124}.dXDvrc{color:#0d652d;font-size:14px;line-height:20px;word-wrap:break-word}.dloBPe{font-weight:bold}.YVIcad{color:#70757a}.JkVVdd{color:#ea4335}.oXZRFd{color:#ea4335}.MQHtg{color:#fbbc04}.pyMRrb{color:#1e8e3e}.EtTZid{color:#1e8e3e}.M3vVJe{color:#1967d2}.qXLe6d{display:block}.NHQNef{font-style:italic}.Cb8Z7c{white-space:pre}a.ZWRArf{text-decoration:none}a .CVA68e:hover{text-decoration:underline}.Dks9wf{width:100%}.KZhhub{border-spacing:0;width:100%}.udTCfd{vertical-align:top;width:100%}.GN4D8d{margin:0}</style><div class="n692Zd"><div class="BnJWBc"><a class="lXLRf" href="/?sca_esv=e1e3193eddeaa204&output=search&sa=X&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQPAgC"><img class="kgJEQe" src="/images/branding/searchlogo/1x/googlelogo_desk_heirloom_color_150x55dp.gif" alt="Google"/></a></div><div class="FbhRzb"><form action="/search"><input name="sca_esv" value="e1e3193eddeaa204" type="hidden"/><input name="oq" type="hidden"/><input name="aqs" type="hidden"/><table class="cvifge"><tr><td class="O4cRJf"><input class="MhzMZd" value="define:Recursive Functional Algorithmic Language" name="q" type="text"/></td><td class="O1ePr"><input class="xB0fq" value="Search" type="submit"/></td></tr></table></form></div><div class="M7pB2"><table class="euZec"><tbody><tr><td class="EY24We"><span class="QIqI7">ALL</span></td><td><a class="CsQyDc" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&tbm=isch&source=lnms&sa=X&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQ_AUIBSgB">IMAGES</a></td><td><a class="CsQyDc" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&tbm=bks&source=lnms&sa=X&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQ_AUIBigC">BOOKS</a></td><td><a class="CsQyDc" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&tbm=vid&source=lnms&sa=X&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQ_AUIBygD">VIDEOS</a></td></tr></tbody></table></div></div><div><div> <div> <div class="ezO2md"><div><div class="FYYwXe"> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">A recursive language is </span> <span class="dloBPe fYyStc">a formal language for which there exists a Turing machine that, when presented with any finite input string, halts and accepts if the string is in the language, and halts and rejects otherwise</span> <span class="fYyStc">.</span> </span> </div> </div><div><a class="fuLhoc ZWRArf" href="/url?q=https://en.wikipedia.org/wiki/Recursive_language&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAsQAg&usg=AOvVaw2lx4I-fsyZa4ZDnCaNHrox"><span class="CVA68e qXLe6d">Recursive language - Wikipedia</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">en.wikipedia.org › wiki › Recursive_language</span> </span> </a></div><div class="oO6lG"> <span class="qXLe6d F9iS2e WMQ2Le"> <a class="M3vVJe" href="https://www.google.com/url?q=https://support.google.com/websearch%3Fp%3Dfeatured_snippets%26hl%3Den-SG&opi=89978449&usg=AOvVaw0XmUePKqidLOPpq7KneD4H">About featured snippets</a> </span> </div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://en.wikipedia.org/wiki/Recursion_(computer_science)&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAoQAg&usg=AOvVaw21jOVAlQy0gQN0bvMlQyQx"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Recursion (computer science) - Wikipedia</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">en.wikipedia.org › wiki › Recursion_(computer_science)</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://www.computer-dictionary-online.org/definitions-r/recursive-functional-algorithmic-language&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAQQAg&usg=AOvVaw0md4dzl8-MWJ7F4_9FU6uM"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Recursive Functional Algorithmic Language</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">www.computer-dictionary-online.org › definitions-r › recursive-functional...</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">(REFAL) A language developed by V.F. Turchin (later at CUNY?) in Moscow in about 1972. See also supercompilation. [V.F. Turchin, "An algorithm of ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://www.javatpoint.com/recursive-algorithm&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAkQAg&usg=AOvVaw0gc7fN7BbjsHnaz6G-49zF"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Recursive Algorithm - Javatpoint</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">www.javatpoint.com › recursive-algorithm</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">Recursion is the action of a function calling itself either directly or indirectly, and the associated function is known as a recursive function.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://www.simplilearn.com/tutorials/data-structure-tutorial/recursive-algorithm&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAMQAg&usg=AOvVaw3D-o8Iy_TKps-IZr7YiXsD"><span class="CVA68e qXLe6d fuLhoc ZWRArf">What is Recursive Algorithm? Types and Methods - Simplilearn.com</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">www.simplilearn.com › ... › Data Structure Tutorial for Beginners</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc YVIcad">20 Feb 2023</span> <span class="fYyStc YVIcad"> · </span> <span class="fYyStc">A recursive algorithm calls itself with smaller input values and returns the result for the current input by carrying out basic operations on ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://stackoverflow.com/questions/156369/which-languages-support-recursive-function-literals-anonymous-functions&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAgQAg&usg=AOvVaw3-pyCwvxhskwOjolIeVgLZ"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Which languages support *recursive* function literals / anonymous ...</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">stackoverflow.com › questions › which-languages-support-recursive-functi...</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc YVIcad">1 Oct 2008</span> <span class="fYyStc YVIcad"> · </span> <span class="fYyStc">Most languages support it through use of the Y combinator. Here's an example in Python (from the cookbook):</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://www.linkedin.com/pulse/recursion-theory-recursive-functions-hasanain-alsabonchi-eh9bc&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAIQAg&usg=AOvVaw2fSIMAMsk03qUqjwEGzFHM"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Recursion Theory and Recursive Functions - LinkedIn</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">www.linkedin.com › pulse</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc YVIcad">27 Dec 2023</span> <span class="fYyStc YVIcad"> · </span> <span class="fYyStc">The mathematical definition of recursion involves defining an object (a function, sequence, or structure) in terms of itself or a part of itself ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://www.geeksforgeeks.org/types-of-recursions/&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAcQAg&usg=AOvVaw27hD1HCy0tMT7bAn1yiuDk"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Types of Recursions - GeeksforGeeks</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">www.geeksforgeeks.org › types-of-recursions</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc YVIcad">7 Dec 2022</span> <span class="fYyStc YVIcad"> · </span> <span class="fYyStc">The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://oliviagallucci.com/recursion-algorithmic-paradigms-complexities-and-pitfalls/&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAUQAg&usg=AOvVaw1PygKhncGjStPN1WH6JF8y"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Recursion: Algorithmic Paradigms, Complexities, and Pitfalls</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">oliviagallucci.com › recursion-algorithmic-paradigms-complexities-and-pit...</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc YVIcad">25 Apr 2024</span> <span class="fYyStc YVIcad"> · </span> <span class="fYyStc">Recursion is where a function calls itself during its execution; its paradigm breaks a problem into smaller instances of the same problem.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="/url?q=https://www.wscubetech.com/resources/dsa/recursive-algorithm&sa=U&ved=2ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQFnoECAYQAg&usg=AOvVaw2QjA8kA9bOivnHfUGlDq-k"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Recursive Algorithm: Examples, Complexity, Types, Uses</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">www.wscubetech.com › resources › dsa › recursive-algorithm</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc YVIcad">18 Sept 2024</span> <span class="fYyStc YVIcad"> · </span> <span class="fYyStc">A recursive algorithm is a method in programming where a function calls itself to solve a smaller version of the same problem.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div></div><table class="uZgmoc"><tbody><td><a class="frGj1b" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&ei=B4RiZ_6mIM7u0PEPyInbgAQ&start=10&sa=N">Next ></a></td></tbody></table><br/><div class="TuS8Ad" data-ved="0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQpyoINg"><style>.VYM29{font-weight:bold}</style><div class="HddGcc" align="center"><span class="VYM29">Singapore</span><span> - </span><span>From your IP address</span><span> - </span><a href="/url?q=https://support.google.com/websearch%3Fp%3Dws_settings_location%26hl%3Den-SG&opi=89978449&sa=U&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQty4INw&usg=AOvVaw10J9P9H7E95VP5p7F6BoFx">Learn more</a></div><div align="center"><a class="rEM8G" href="/url?q=https://accounts.google.com/ServiceLogin%3Fcontinue%3Dhttps://www.google.com/search%253Fq%253Ddefine:Recursive%252BFunctional%252BAlgorithmic%252BLanguage%26hl%3Den&opi=89978449&sa=U&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQxs8CCDg&usg=AOvVaw0U4eHR7sKkOwY-oj8Dr6Dg">Sign in</a></div><div><table class="bookcf"><tbody class="InWNIe"><tr><td><a class="rEM8G" href="https://www.google.com/preferences?hl=en&sa=X&ved=0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQv5YECDk">Settings</a></td><td><a class="rEM8G" href="https://www.google.com/intl/en_sg/policies/privacy/">Privacy</a></td><td><a class="rEM8G" href="https://www.google.com/intl/en_sg/policies/terms/">Terms</a></td></tr></tbody></table></div></div><div> </div></body></html>