Anonymous user
Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions
Rosetta Code:Village Pump/Suggest a programming task (view source)
Revision as of 09:33, 2 May 2014
, 10 years ago→Unsorted
Line 304:
* Task: bAckermann. The idea is to take the Ackermann function and find the sequence of all possible calls to the function sorted by number of recursions. The output would begin:
A(0,0) , A(0,1) , ... , A(1,0) , A(1,1) , A(2,0) etc.
* Implement [http://en.wikipedia.org/wiki/Duff%27s_device Duff's Device] or a near equivalent [[User:Axtens|Axtens]] ([[User talk:Axtens|talk]]) 03:27, 26 April 2014 (UTC)
| |||