{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-05-26T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":734,"title":"Ackermann's Function","description":"Ackermann's Function is a recursive function that is not 'primitive recursive.'\r\n\r\n\r\n\u003chttp://en.wikipedia.org/wiki/Ackermann_function Ackermann Function\u003e\r\n\r\nThe first argument drives the value extremely fast.\r\n\r\nA(m, n) =\r\n\r\n*   n + 1 if m = 0\r\n*   A(m − 1, 1) if m \u003e 0 and n = 0\r\n*   A(m − 1,A(m, n − 1)) if m \u003e 0 and n \u003e 0\r\n\r\n  \r\nA(2,4)=A(1,A(2,3)) = ... = 11.\r\n\r\n  % Range of cases\r\n  % m=0 n=0:1024\r\n  % m=1 n=0:1024\r\n  % m=2 n=0:128\r\n  % m=3 n=0:6\r\n  % m=4 n=0:1\r\n\r\nThere is some deep recusion.\r\n\r\n*\r\nInput:* m,n\r\n\r\n*Out:* Ackerman value\r\n\r\n\r\nAckermann(2,4) = 11\r\n\r\nPractical application of Ackermann's function is determining compiler recursion performance.","description_html":"\u003cp\u003eAckermann's Function is a recursive function that is not 'primitive recursive.'\u003c/p\u003e\u003cp\u003e\u003ca href=\"http://en.wikipedia.org/wiki/Ackermann_function\"\u003eAckermann Function\u003c/a\u003e\u003c/p\u003e\u003cp\u003eThe first argument drives the value extremely fast.\u003c/p\u003e\u003cp\u003eA(m, n) =\u003c/p\u003e\u003cul\u003e\u003cli\u003en + 1 if m = 0\u003c/li\u003e\u003cli\u003eA(m − 1, 1) if m \u003e 0 and n = 0\u003c/li\u003e\u003cli\u003eA(m − 1,A(m, n − 1)) if m \u003e 0 and n \u003e 0\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eA(2,4)=A(1,A(2,3)) = ... = 11.\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e% Range of cases\r\n% m=0 n=0:1024\r\n% m=1 n=0:1024\r\n% m=2 n=0:128\r\n% m=3 n=0:6\r\n% m=4 n=0:1\r\n\u003c/pre\u003e\u003cp\u003eThere is some deep recusion.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e m,n\u003c/p\u003e\u003cp\u003e\u003cb\u003eOut:\u003c/b\u003e Ackerman value\u003c/p\u003e\u003cp\u003eAckermann(2,4) = 11\u003c/p\u003e\u003cp\u003ePractical application of Ackermann's function is determining compiler recursion performance.\u003c/p\u003e","function_template":"function vAck = ackermann(m,n)\r\n set(0,'RecursionLimit',512);\r\n\r\n vAck=0;\r\n\r\nend","test_suite":"%%\r\nm=0;\r\nn=1;\r\nAck = n+1;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=0;\r\nn=1024;\r\nAck = n+1;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=0;\r\nn=randi(1024)\r\nAck = n+1;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=1;\r\nn=1024\r\nAck = n+2;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=1;\r\nn=randi(1024)\r\nAck = n+2;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=2;\r\nn=randi(128)\r\nAck = 2*n+3;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=3;\r\nn=6;\r\nAck = 509;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=3;\r\nn=randi(6)\r\nAck = 2^(n+3)-3;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=4;\r\nn=0;\r\nAck = 13;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=4;\r\nn=1; % Fails at RecursionLimit 1030; Create Special\r\nAck = 65533;\r\nassert(isequal(ackermann(m,n),Ack))","published":true,"deleted":false,"likes_count":4,"comments_count":2,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":81,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":25,"created_at":"2012-06-02T02:10:19.000Z","updated_at":"2026-04-08T15:29:42.000Z","published_at":"2012-06-02T02:36:59.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAckermann's Function is a recursive function that is not 'primitive recursive.'\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"http://en.wikipedia.org/wiki/Ackermann_function\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eAckermann Function\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe first argument drives the value extremely fast.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(m, n) =\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003en + 1 if m = 0\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(m − 1, 1) if m \u0026gt; 0 and n = 0\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(m − 1,A(m, n − 1)) if m \u0026gt; 0 and n \u0026gt; 0\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(2,4)=A(1,A(2,3)) = ... = 11.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[% Range of cases\\n% m=0 n=0:1024\\n% m=1 n=0:1024\\n% m=2 n=0:128\\n% m=3 n=0:6\\n% m=4 n=0:1]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThere is some deep recusion.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e m,n\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOut:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Ackerman value\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAckermann(2,4) = 11\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ePractical application of Ackermann's function is determining compiler recursion performance.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"problems":[{"id":734,"title":"Ackermann's Function","description":"Ackermann's Function is a recursive function that is not 'primitive recursive.'\r\n\r\n\r\n\u003chttp://en.wikipedia.org/wiki/Ackermann_function Ackermann Function\u003e\r\n\r\nThe first argument drives the value extremely fast.\r\n\r\nA(m, n) =\r\n\r\n*   n + 1 if m = 0\r\n*   A(m − 1, 1) if m \u003e 0 and n = 0\r\n*   A(m − 1,A(m, n − 1)) if m \u003e 0 and n \u003e 0\r\n\r\n  \r\nA(2,4)=A(1,A(2,3)) = ... = 11.\r\n\r\n  % Range of cases\r\n  % m=0 n=0:1024\r\n  % m=1 n=0:1024\r\n  % m=2 n=0:128\r\n  % m=3 n=0:6\r\n  % m=4 n=0:1\r\n\r\nThere is some deep recusion.\r\n\r\n*\r\nInput:* m,n\r\n\r\n*Out:* Ackerman value\r\n\r\n\r\nAckermann(2,4) = 11\r\n\r\nPractical application of Ackermann's function is determining compiler recursion performance.","description_html":"\u003cp\u003eAckermann's Function is a recursive function that is not 'primitive recursive.'\u003c/p\u003e\u003cp\u003e\u003ca href=\"http://en.wikipedia.org/wiki/Ackermann_function\"\u003eAckermann Function\u003c/a\u003e\u003c/p\u003e\u003cp\u003eThe first argument drives the value extremely fast.\u003c/p\u003e\u003cp\u003eA(m, n) =\u003c/p\u003e\u003cul\u003e\u003cli\u003en + 1 if m = 0\u003c/li\u003e\u003cli\u003eA(m − 1, 1) if m \u003e 0 and n = 0\u003c/li\u003e\u003cli\u003eA(m − 1,A(m, n − 1)) if m \u003e 0 and n \u003e 0\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eA(2,4)=A(1,A(2,3)) = ... = 11.\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e% Range of cases\r\n% m=0 n=0:1024\r\n% m=1 n=0:1024\r\n% m=2 n=0:128\r\n% m=3 n=0:6\r\n% m=4 n=0:1\r\n\u003c/pre\u003e\u003cp\u003eThere is some deep recusion.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e m,n\u003c/p\u003e\u003cp\u003e\u003cb\u003eOut:\u003c/b\u003e Ackerman value\u003c/p\u003e\u003cp\u003eAckermann(2,4) = 11\u003c/p\u003e\u003cp\u003ePractical application of Ackermann's function is determining compiler recursion performance.\u003c/p\u003e","function_template":"function vAck = ackermann(m,n)\r\n set(0,'RecursionLimit',512);\r\n\r\n vAck=0;\r\n\r\nend","test_suite":"%%\r\nm=0;\r\nn=1;\r\nAck = n+1;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=0;\r\nn=1024;\r\nAck = n+1;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=0;\r\nn=randi(1024)\r\nAck = n+1;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=1;\r\nn=1024\r\nAck = n+2;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=1;\r\nn=randi(1024)\r\nAck = n+2;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=2;\r\nn=randi(128)\r\nAck = 2*n+3;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=3;\r\nn=6;\r\nAck = 509;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=3;\r\nn=randi(6)\r\nAck = 2^(n+3)-3;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=4;\r\nn=0;\r\nAck = 13;\r\nassert(isequal(ackermann(m,n),Ack))\r\n%%\r\nm=4;\r\nn=1; % Fails at RecursionLimit 1030; Create Special\r\nAck = 65533;\r\nassert(isequal(ackermann(m,n),Ack))","published":true,"deleted":false,"likes_count":4,"comments_count":2,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":81,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":25,"created_at":"2012-06-02T02:10:19.000Z","updated_at":"2026-04-08T15:29:42.000Z","published_at":"2012-06-02T02:36:59.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAckermann's Function is a recursive function that is not 'primitive recursive.'\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:hyperlink w:docLocation=\\\"http://en.wikipedia.org/wiki/Ackermann_function\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eAckermann Function\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe first argument drives the value extremely fast.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(m, n) =\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003en + 1 if m = 0\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(m − 1, 1) if m \u0026gt; 0 and n = 0\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(m − 1,A(m, n − 1)) if m \u0026gt; 0 and n \u0026gt; 0\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA(2,4)=A(1,A(2,3)) = ... = 11.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[% Range of cases\\n% m=0 n=0:1024\\n% m=1 n=0:1024\\n% m=2 n=0:128\\n% m=3 n=0:6\\n% m=4 n=0:1]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThere is some deep recusion.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e m,n\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOut:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Ackerman value\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAckermann(2,4) = 11\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ePractical application of Ackermann's function is determining compiler recursion performance.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"errors":[],"facets":[[{"value":"Functions I","count":1,"selected":false}],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"rozsa peter\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}