You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360734
Title: 
Recursion in the ackermann function
Author(s): 
Stephen, Wolfram
Language: 
eng
Description: 
  • Mathematical Logic
  • The Ackermann function is a classic example of a function that is not "primitive recursive"-its evaluation cannot be "unwound" into simple loops. See how instances of the Ackermann function get evaluated by calling on others. The Ackermann function grows very rapidly. As its first argument increases, it effectively goes from addition, to multiplication, powers, power towers, etc
  • Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
Issue Date: 
  • 11-Sep-2008
  • 11-Sep-2008
  • 2008
  • 11-Sep-2008
  • 10-Sep-2008
Keywords: 
  • Mathematical logic
  • Computer science
  • Foundations of mathematics
  • Lógica matemática
  • Educação Superior::Ciências Exatas e da Terra::Matemática::Matemática Aplicada
Notes: 
Show how to use the Recursion in the Ackermann Function
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5222
URI: 
http://acervodigital.unesp.br/handle/unesp/360734
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.