Ackermann function - PDFSEARCH.IO - Document Search Engine

Ackermann function
Results: 7

#	Item
1	Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second, Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-01-08 10:48:49 Theory of computation Computability theory Busy beaver Computable function Computability Turing machine Halting problem Hypercomputation Computable number Algorithm Alan Turing Ackermann function
2	Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540 Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2012-11-16 09:11:59 Computability theory Mathematical logic Mathematics Theoretical computer science Primitive recursive function Primitive recursive arithmetic ELEMENTARY Reverse mathematics Pairing function Ackermann function Sequence Recursion
3	Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second, Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2008-12-18 11:10:27 Theory of computation Computability theory Busy beaver Computable function Computability Turing machine Halting problem Hypercomputation Computable number Algorithm Alan Turing Ackermann function
4	The Ackermann Award 2008 J.A. Makowsky and D. Niwinski Members of EACSL Jury for the Ackermann Award! The fourth Ackermann Award is presented at this CSL’08. This is the second year in which the EACSL Ackermann Award i Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Game theory Determinacy Logic in computer science Parity game Wilhelm Ackermann Ackermann function IEEE Symposium on Logic in Computer Science Computational complexity theory Stochastic Mathematics Mathematical logic Theoretical computer science
5	The Ackermann Award 2009 J.A. Makowsky and A. Razborov Members of EACSL Jury for the Ackermann Award The ﬁfth Ackermann Award is presented at this CSL’09, held in Coimbra, Portugal. This is the third year in which th Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Logic Wilhelm Ackermann Alexander Razborov Proof complexity DPLL algorithm Resolution Computational complexity theory Ackermann function Propositional proof system Theoretical computer science Mathematics Automated theorem proving
6	Optimizing Ackermann’s Function by Incrementalization∗ Yanhong A. Liu Add to Reading List Source URL: www.cs.stonybrook.edu Language: English - Date: 2006-12-05 12:57:55 Recursion Computability theory Theory of computation Subroutines Programming idioms Primitive recursive function Aall Tail call Dynamic programming Computer programming Computing Software engineering
7	CAVALIERI INTEGRATION T. L. GROBLER† , E. R. ACKERMANN‡ , A. J. VAN ZYL# , AND J. C. OLIVIER Add to Reading List Source URL: researchspace.csir.co.za Language: English - Date: 2011-11-08 16:55:13 Functions and mappings Riemann integral Integral Riemann sum Bonaventura Cavalieri Fundamental theorem of calculus Riemann–Stieltjes integral Lebesgue integration Continuous function Mathematical analysis Calculus Integral calculus

UPDATE