Search - ackermann

Search - ackermann - List

[Other resource] ACKFunction DL : 0: 实现阿克曼函数并统计递归调用次数 Counting times of recursion calling 1．问题描述定义阿克曼递归函数： ACK(0,n)=n+1 n>=0 ACK(m,0)=ACK(m-1,1) m>=1 ACK(m,n)=ACK(m-1,ACK(m,n-1)) m,n>0 2．基本要求读入m、n，输出ACK(m,n)的值，并统计递归调用次数。-Ackermann achieve statistical and recursive function call Counting the number of times recur as contemplated by calling 1. Problem description definition of a recursive function Ackerman : ACK (0, n) = n 1 n
Date : 2008-10-13 Size : 8.55kb User : 李昭明
[Other resource] Ackermann DL : 0: Ackermann for Data Structure -Ackermann for Data Structure
Date : 2008-10-13 Size : 820byte User : 王浩
[Other resource] Ackermann DL : 0: 此文件实现Ackerman函数的动态规划算法，在VC＋＋6.0 下编译通过
Date : 2008-10-13 Size : 713byte User : tony chen
[Other resource] Ackermann DL : 0: 1928年，Wilhelm Ackermann (1896 - 1962，David Hilbert的学生) 发现x的y次幂的z-重积分 A(x,y,z)是递归的但不是原始递归的。Rosza Peter将A(x,y,z)简化到二元函数，初始条件由Raphael Robinson简化。
Date : 2008-10-13 Size : 5.83kb User : 陈大哥
[Other resource] Ackermann-nonrecursive DL : 0: Ackermann-nonrecursive.cpp, 艾克曼, 非递回
Date : 2008-10-13 Size : 1.26kb User : YC_CHIANG
[Data structs] ACKFunction DL : 0: 实现阿克曼函数并统计递归调用次数 Counting times of recursion calling 1．问题描述定义阿克曼递归函数： ACK(0,n)=n+1 n>=0 ACK(m,0)=ACK(m-1,1) m>=1 ACK(m,n)=ACK(m-1,ACK(m,n-1)) m,n>0 2．基本要求读入m、n，输出ACK(m,n)的值，并统计递归调用次数。-Ackermann achieve statistical and recursive function call Counting the number of times recur as contemplated by calling 1. Problem description definition of a recursive function Ackerman : ACK (0, n) = n 1 n
Date : 2025-07-11 Size : 574kb User : 李昭明
[Data structs] Ackermann DL : 0: Ackermann for Data Structure -Ackermann for Data Structure
Date : 2025-07-11 Size : 1kb User : 王浩
[Data structs] Ackermann DL : 0: 此文件实现Ackerman函数的动态规划算法，在VC＋＋6.0 下编译通过-This document is the realization of Ackerman function of dynamic programming algorithm, in VC 6.0 under the compiler through
Date : 2025-07-11 Size : 1kb User : tony chen
[Data structs] Ackermann DL : 0: 1928年，Wilhelm Ackermann (1896 - 1962，David Hilbert的学生) 发现x的y次幂的z-重积分 A(x,y,z)是递归的但不是原始递归的。Rosza Peter将A(x,y,z)简化到二元函数，初始条件由Raphael Robinson简化。 -In 1928, Wilhelm Ackermann (1896- 1962, David Hilbert students) found x of y times the power of the z-heavy points A (x, y, z) is recursive but not primitive recursive. Rosza Peter will be A (x, y, z) to simplify to the dual function, the initial conditions simplified by Raphael Robinson.
Date : 2025-07-11 Size : 870kb User : 陈大哥
[Data structs] Ackermann-nonrecursive DL : 0: Ackermann-nonrecursive.cpp, 艾克曼, 非递回-Ackermann-nonrecursive.cpp, Aikman, non-recursive
Date : 2025-07-11 Size : 1kb User : YC_CHIANG
[Data structs] akm DL : 0: 阿克曼函数，一种十分有效的函数，在数据结构中使用得多。-Ackermann function, a very effective function of the data structure in the use of much more.
Date : 2025-07-11 Size : 1kb User : ada
[Windows Develop] Ackermann DL : 0: 本程序是用来产生Ackerman函数的一个小程序-This procedure is used to generate a small program Ackerman function
Date : 2025-07-11 Size : 244kb User : LR
[Data structs] 19840356 DL : 0: 阿克曼函数的非递归算法，一种非常经典的函数，数据结构中的典型函数-Ackermann function is non-recursive algorithm, a very classic function, data structure typical function
Date : 2025-07-11 Size : 544kb User : 茅小祥
[AI-NN-PR] ackermann DL : 0: mmodèle ackermann, modélisation
Date : 2025-07-11 Size : 288kb User : oussama
[Data structs] Ackerman DL : 0: 阿克曼函数（Ackerman）是非原始递归函数的例子；它需要两个自然数作为输入值，输出一个自然数。它的输出值增长速度非常高，仅是(4,3)的输出已大得不能准确计算。　　Ackerman函数定义如下: 　　若m=0 返回n+1 　　若m>0且n=0 返回Ackerman(m-1,1) 　　若m>0且n>0 返回Ackerman(m-1,Ackerman(m,n-1)) -Ackermann function (Ackerman) examples of non-primitive recursive function it takes two natural numbers as input, output a natural number. Its output value growth rate is very high, only (4,3) output has been so large that can not be accurately calculated. Ackerman function is defined as follows: If m = 0 return n+1 if m> 0 and n = 0 return Ackerman (m-1, 1) if m> 0 and n> 0 return Ackerman (m-1, Ackerman (m, n-1))
Date : 2025-07-11 Size : 7kb User : 夏雪
[Energy industry] wind_power_in_power_systems DL : 0: wind power in power systems by Thomas Ackermann Wind energy is gaining increasing importance throughout the world. A very good reference for wind energy engineers.
Date : 2025-07-11 Size : 6mb User : myc
[matlab] ackermann DL : 0: ackerman for pid tuning
Date : 2025-07-11 Size : 1kb User : tirta nahari
[Other Embeded program] Ackermann-Euracom-18x-Eprom-Firmware-Version-5D00 DL : 0: Firmware for Ackermann/Euracom phone PBXs
Date : 2025-07-11 Size : 375kb User : xA3
[Console] src DL : 0: 汉诺塔问题以及阿克曼函数问题算法的实现 c++编写数据结构小作业-The Towers of Hanoi problem Ackermann function problem algorithm c++ of writing the data structure operations
Date : 2025-07-11 Size : 1kb User : 刘维孟
[Data structs] ack DL : 0: Calculate the Ackermann function ACK ( m, n ) recursive functions.-Calculate the Ackermann function ACK ( m, n ) recursive functions. For m>=0, n>=0, ACK ( m, n ) is defined as: ACK ( 0, n ) =n+1 ACK ( m, 0) =ACK ( m-1,1 ) ACK ( m, n ) =ACK ( m-1, ACK ( m, m-1 ) )
Date : 2025-07-11 Size : 1kb User : 周杨

« 12 »