Problem 734. Ackermann's Function

Created by Richard Zapor

Solve Later

{"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":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Ackermann's Function is a recursive function that is not 'primitive recursive.'</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Ackermann_function\"><w:r><w:t>Ackermann Function</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The first argument drives the value extremely fast.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A(m, n) =</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>n + 1 if m = 0</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>A(m − 1, 1) if m &gt; 0 and n = 0</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>A(m − 1,A(m, n − 1)) if m &gt; 0 and n &gt; 0</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A(2,4)=A(1,A(2,3)) = ... = 11.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![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]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>There is some deep recusion.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> m,n</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Out:</w:t></w:r><w:r><w:t> Ackerman value</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Ackermann(2,4) = 11</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Practical application of Ackermann's function is determining compiler recursion performance.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

213 Solutions
67 Solvers

Last Solution submitted on Apr 04, 2023

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Richard Zapor on 5 Jun 2012

Solution 15 is, to me, a novel cell array index implementation.

Jean-Marie Sainthillier on 19 Jul 2013

Efficiently to crash my Matlab.

Solution Comments

Show comments

Problem Recent Solvers67

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 734. Ackermann's Function

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers67

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 734. Ackermann's Function

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers67

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players