The Computer Contradictionary by Stan Kelly Bootle is a satirical list of definitions of computer industry terms. It is an example of cynical lexicography in the tradition of Ambrose Bierce s The Devil s Dictionary . It was originally published as The Devil s DP Dictionary , in New York, by McGraw Hill in 1981, ISBN 0070340226. DP stood for data processing , a term formerly used to describe the computer hardware and software industries. It was re edited under the new title in Boston by MIT Press , in 1995, ISBN 0262611120. Kelly Bootle adds in the Guide The meaning of an entry should always be ascertained before consulting this dictionary . Examples Endless loop . See Loop, endless Loop, endless . See Endless loop Recursion . See Recursion See also The Devil s Dictionary Wickedictionary Category Satirical books ... more details
Context date February 2010 An apomorphism from wikt Greek language Greek for apart is the categorical dual of a paramorphism and an extension of the concept of anamorphism coinduction . Whereas a paramorphism models primitive recursion over an inductive data type , an apomorphism models primitive corecursion over a coinductive data type . Origins The term apomorphism was introduced in Functional Programming with Apomorphisms Corecursion ref citation last Vene first Varmo first2 Tarmo last2 Uustalu title Functional Programming with Apomorphisms Corecursion journal Proceedings of the Estonian Academy of Sciences Physics, Mathematics volume 47 pages 147 161 year 1998 url http citeseer.ist.psu.edu vene98functional.html issue 3 ref . References references See also Anamorphism Catamorphism Hylomorphism computer science Hylomorphism Paramorphism Category Recursion schemes formalmethods stub ... more details
In computer science , Hennessy Milner logic HML is a multimodal logic used to specify properties of a labeled transition system , a structure similar to an automaton. It was introduced in 1980 by Matthew Hennessy and Robin Milner in their paper On observing nondeterminism and concurrency ICALP . Another variant of the HML involves the use of recursion to extend the expressibility of the logic, and is commonly referred to as Hennessy Milner Logic with recursion ref name HMLwithRecursion cite journal last Holmstr m first S ren title Hennessy Milner Logic with Recursion as a Specification Language, and a Refinement Calculus based on It journal Proceedings of the BCS FACS Workshop on Specification and Verification of Concurrent Systems year 1990 pages 294 330 pmid Springer Verlag ref . Recursion is enabled with the use of maximum and minimum fixed points. Syntax A formula is defined by the following BNF grammar for L some set of actions math Phi tt , , , , , ,ff , , , , , , Phi 1 land Phi 2 , , , , , , Phi 1 lor Phi 2 , , , , , , L Phi , , , , , , langle L rangle Phi math That is, a formula can be constant truth always true constant false always false formula logical conjunction conjunction formula logical disjunction disjunction math scriptstyle L Phi math formula for all L derivatives, must hold math scriptstyle langle L rangle Phi math formula for some L derivative, must hold See also The modal calculus extends HML with fixed point operator s. Dynamic logic modal logic Dynamic logic , a multimodal logic with infinitely many modalities. References cite book author Colin P. Stirling title Modal and temporal properties of processes year 2001 publisher Springer isbn 9780387987170 pages 32 39 S ren Holmstr m. 1988. Hennessy Milner Logic with Recursion as a Specification Language, and a Refinement Calculus based on It. In Proceedings of the BCS FACS Workshop on Specification and Verification of Concurrent Systems, Charles Rattray Ed. . Springer Verlag, London, UK, 29 ... more details
Wiktionary forcing Forcing may refer to Forcing set theory , a technique for obtaining proofs in set theory Forcing recursion theory Radiative forcing , the difference between the incoming radiation energy and the outgoing radiation energy in a given climate system Cloud forcing , the difference between the radiation budget components for average cloud conditions and cloud free conditions Forcing magic , a technique by which a magician forces one outcome from a card draw Forcing, driving a harmonic oscillator at a particular frequency disambiguation ... more details
recursion for the upper and lower parts of the convex hull in the recursion for the upper hull, the noncontributing points to be discarded are those below the bridge edge, while in the recursion for the lower hull the points above the bridge edge are discarded. At the i th level of the recursion ... that is, when there are exactly 2 sup i sup subproblems in each level of recursion up to level log sub 2 sub h . For this worst case, there are O log h levels of recursion and O n points considered ... more details
Other uses In software, a stack overflow occurs when too much computer memory memory is used on the call stack . The call stack contains a limited amount of memory, often determined at the start of the program. The size of the call stack depends on many factors, including the programming language, machine architecture, multi threading, and amount of available memory. When a program attempts to use more space than is available on the call stack that is, when it attempts to access memory beyond the call stack s bounds, which is essentially a buffer overflow , the stack is said to overflow , typically resulting in a program crash. ref name fortran1 cite web last Burley first James Craig title Using and Porting GNU Fortran url http sunsite.ualberta.ca Documentation Gnu gcc 2.95.2 html node g77 597.html date 1991 06 01 ref This class of software bug is usually caused by one of two types of programming errors. ref name devx cite web last Danny first Kalev title Understanding Stack Overflow url http www.devx.com tips Tip 14276 date 2000 09 05 ref Infinite recursion Main infinite recursion The most common cause of stack overflows is excessively deep or infinite recursion. Languages like Scheme programming language Scheme , which implement tail call optimization , allow infinite recursion of a specific sort tail recursion to occur without stack overflow. This works because tail recursion calls do not take up additional stack space. ref name tailRecur cite web title An Introduction to Scheme and its Implementation url http www.federated.com jim schintro v14 schintro 73.html date 1997 02 19 ref An example of infinite recursion in C programming language C . source lang c int foo return foo source The function foo , when it is invoked, continues to invoke itself , using additional space on the stack each time, until the stack overflows resulting in a segmentation fault . ref http stackoverflow.com questions 2685413 what is the difference between a segmentation fault and a stack ... more details
A stack register is a computer central processor register whose purpose is to keep track of a call stack . On an accumulator based architecture machine, this may be a dedicated register such as SP on an Intel x86 machine. On a general register machine , it may be a register which is reserved by convention, such as on the PDP 11 or RISC machines. Some designs such as the Data General Eclipse had no dedicated register, but used a reserved hardware memory address for this function. Machines before the late 1960s&mdash such as the PDP 8 and HP 2100 &mdash did not have compilers which supported Recursion computer science recursion . Their subroutine instructions typically would save the current location in the jump address, and then set the program counter to the next address. ref cite book author David Salomon title Assemblers and Loaders month February year 1993 publisher Ellis Horwood Ltd isbn 0130525642 url http www.davidsalomon.name assem.advertis asl.pdf accessdate 2008 10 01 quote Most computers save the return address in either the stack, in one of the registers, or in the rst word of the procedure in which case the rst executable instruction of the procedure should be stored in the second word . If the latter method is used, a return from the procedure is a jump to the memory location whose address is contained in the rst word of the procedure. ref While this is simpler than maintaining a stack, since there is only one return location per subroutine code section, there cannot be recursion without considerable effort on the part of the programmer. A stack machine has 2 or more stack registers &mdash one of them keeps track of a call stack , the other s keep track of other stack data structure stack s . References reflist Category Control flow Category Central processing unit Category Digital registers computer hardware stub comp sci stub es Registro de pila pl Wska nik stosu ... more details
Image Dimiter Skordev.jpg thumb left Dimiter Skordev Dimiter Skordev born 1936 in Sofia is a professor in the Department of Mathematical Logic and Applications, Faculty of Mathematics and Computer Science at the St. Kliment Ohridski University of Sofia . Chairman of the department in 1972 2000. Doyen and pioneer of mathematical logic research in Bulgaria who developed a Bulgarian school in the theory of computability, namely the algebraic or axiomatic recursion theory. Skordev s field of scientific interests include recursion theory computability and computational complexity complexity in mathematical analysis analysis , mathematical logic , generalized recursion theory , and theory of computer programs programs and theory of computation computation . Skordev has over 35 years of lecturing experience in calculus , mathematical logic , logic programming , discrete mathematics , and computer science . He authored more than 100 scientific publications including two monographs, and was the principal author of the new Bulgarian phonetics phonetic keyboard layout Bulgarian keyboard layout proposed but rejected to become a state Standardization standard in 2006. References http www.fmi.uni sofia.bg fmi logic skordev Dimiter Skordev http www.fmi.uni sofia.bg fmi logic skordev history.htm Historical notes on the development of mathematical logic in Sofia Persondata Metadata see Wikipedia Persondata . NAME Skordev, Dimiter ALTERNATIVE NAMES SHORT DESCRIPTION DATE OF BIRTH 1936 PLACE OF BIRTH DATE OF DEATH PLACE OF DEATH DEFAULTSORT Skordev, Dimiter Category 1936 births Category Living people Category 20th century mathematicians Category 21st century mathematicians Category Mathematical logicians Category Bulgarian logicians Category Bulgarian mathematicians Bulgaria scientist stub Euro mathematician stub bg sk Dimiter Skordev ... more details
wiktionary tail Tail is the section at the rear end of an animal s body, a distinct, flexible appendage to the torso. Tail s may also refer to Tail Unix , a Unix program used to display the last few lines of a file Tails album Tails album , an album by Lisa Loeb Miles Tails Prower , a character in the Sonic the Hedgehog video games and comics The Obverse and reverse reverse side of a coin Tails or tailcoat or tailsuit, a type of coat suit used for evening dress white tie formalwear Tail, the empennage of an aircraft Tail, the luminous matter anti sunwards from a comet Tail, the final batsmen in the Batting order cricket batting order for cricket Tail, one of the extreme ends of a probability density function Tail or fee tail , an obsolescent term in common law T.A.I.L.S. The Amnesic Incognito Live System , a Linux distribution designed for anonymity and privacy, which includes Tor. Tail, a character in the Kaiketsu Zorori movie Terminal amine isotopic labeling of substrates See also Tailing disambiguation Tail recursion , a type of recursion in computer programming Tail sequence , an unbounded sequence of contiguous ordinals Tail rotor , a small vertical propeller mounted at the rear of a helicopter disambig zh yue Tail de Tail es Cola desambiguaci n fr Tail it Coda pl Ogon ru ... more details
Unreferenced date December 2009 Cyclic history is a theory which dictates that the major forces that motivate human actions return in a cycle. Among these forces are religion spirituality , politics , science , philosophy , curiosity , creativity , psychology, morality and astronomical conjunctions. D. H. Lawrence thought that there existed a high technology civilization in the remote past. Religion recurs whenever a new sect reaches a large population. Christianity peaked three times around the 2nd century AD, when the core of believers gained political power in the Middle Ages , when the Church controlled almost all knowledge in Europe during the Protestant Reformation reformation , where the religion split and the many branches modernized themselves. The theory of cyclic history was considered in A. E. van Vogt s 1950 science fiction novel, The Voyage of the Space Beagle . Recursion of historical cycles For more articles about the concept of recursion of historical cycles see The ricorso of Giambattista Vico Major works and their reception Giambattista Vico . The Decline of the West by Oswald Spengler . See also Yuga DEFAULTSORT Cyclic History Category Historiography Category Theories of history pt Teoria da hist ria c clica ... more details
lowercase occam In computer science , occam or occam pi is the name of a variant of the Occam programming language occam programming language developed by the Kent Retargetable occam Compiler KRoC team at the University of Kent . ref name kroc cite web url http www.cs.kent.ac.uk projects ofa kroc title occam pi blending the best of CSP and the pi calculus author Fred Barnes and Peter Welch date 2006 01 14 accessdate 2006 11 24 ref The name reflects the introduction of elements of the Pi calculus calculus into occam, particularly concepts involving Mobile agent mobile processes and data. The language contains a significant number of extensions to occam 2.1, including Nested protocols Run time process creation Mobile channels, data, and processes Recursion computer science Recursion Protocol inheritance Array Constructor computer science constructors Extended Synchronous rendezvous rendezvous See also Occam programming language Transputer KRoC Transterpreter References See http en.wikipedia.org wiki Wikipedia Footnotes for tips on adding references using ref tags Reflist External links http occam pi.org The occam programming language http projects.cs.kent.ac.uk projects tock trac Tock Occam compiler Category Concurrent programming languages Category University of Kent Compu lang stub comp sci stub ... more details
unreferenced date July 2007 Image NestingTypes01.jpg thumb right Pictorial representations of three different types of nesting algorithms Linear, Plate and Packing Nesting algorithms are used to make the most efficient use of material or space by evaluating many different possible combinations via Recursion computer science recursion . Linear 1 dimensional The simplest of the algorithms illustrated here. For an existing set there is only one position where a new cut can be placed at the end of the last cut. Validation of a combination involves a simple Stock Yield Kerf Scrap calculation. Plate 2 dimensional These algorithms are significantly more complex. For an existing set, there may be as many as eight positions where a new cut may be introduced next to each existing cut, and if the new cut is not perfectly square then different rotations may need to be checked. Validation of a potential combination involves checking for intersections between two dimensional objects. Packing 3 dimensional These algorithms are the most complex illustrated here due to the larger number of possible combinations. Validation of a potential combination involves checking for intersections between Three dimensional space three dimensional objects. Category Geometric algorithms science software stub ... more details
wiktionarypar recurrence recurrent Recurrence and recurrent may refer to Recurrence relation , an equation which defines a sequence recursively Poincar recurrence theorem , Henri Poincar s theorem on dynamical systems Recurrence plot , a statistical plot that shows a pattern that re occurs Recurrence period density entropy , an information theoretic method for summarising the recurrence properties of a dynamical systems Recurrent neural network , a special artificial neural network Recurrent rotation , a term used in contemporary hit radio for frequently aired songs Recurrence album Recurrence album , a 2008 metalcore album by Vira Radial recurrent artery Radial recurrent artery anatomy arising from the radial artery immediately below the elbow See also Recursion disambig de Rekurrenz fr R currence ... more details
For the god Fafner in Norse mythology Fafnir Multiple issues orphan April 2012 unreferenced July 2009 notability July 2009 Factoring via Network Enabled Recursion FAFNER was a 1995 project trying to solve the RSA 130 factoring problem. It was an internet based sieving effort from Cooperating Systems Corporation . Although much human intervention was required to distribute and collate results, this project can be seen as one of the forerunners for internet based distributed computing projects such as SETI home and distributed.net . See also List of distributed computing projects DEFAULTSORT Fafner Category Distributed computing projects compu network stub fr Factorisation par r cursivit activ e par r seau ... more details
Effective descriptive set theory is the branch of descriptive set theory dealing with Set mathematics sets of real number reals having lightface definitions that is, definitions that do not require an arbitrary real parameter . Thus effective descriptive set theory combines descriptive set theory with recursion theory . References cite book authorlink Yiannis N. Moschovakis author Moschovakis, Yiannis N. title Descriptive Set Theory publisher North Holland year 1980 isbn 0 444 70199 0 http www.math.ucla.edu ynm books.htm Second edition available online Category Effective descriptive set theory settheory stub ... more details
In recursion theory computability theory , a Turing degree X is low if the Turing jump X &prime is 0&prime , which is the least possible degree in terms of Turing reducibility for the jump of a set. Since every set is computable from its jump, any low set is computable in 0&prime . A set is low if it has low degree. More generally, a set X is generalized low if it satisfies X &prime sub T sub X 0&prime . See also High computability Low Basis Theorem References Soare, R. Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer Verlag, Berlin, 1987. ISBN 3 540 15299 7 Category Computability theory Mathlogic stub ... more details
as follows export function main args print Hello, world n return 0 The following is an example of a recursion recursive function export function main args print Recursion test 1 n procedure recurse arg print arg , arg, n if arg recurse arg 1 recurse 10 print Recursion test 2 Mutual Recursion n procedure ... arg mrecurse1 arg 1 mrecurse1 10 print Recursion test 2 Mutual Recursion with Function Reference ... arg 1, fn mrrecurse1 10, mrr2 print Recursion tests done. n return 0 Internals EEL source ... more details
or complicated problem in order to get the recursion going, and there is no systematic method for finding ... tail recursion , they can be converted into simple loop computing loop s. Under this broad definition, however, every algorithm that uses recursion or loops could be regarded as a divide and conquer ... , SIAM J. Scientific Computing 14 4 , 783 799 1993 . ref Implementation issues Recursion Divide ... in some applications e.g. in breadth first recursion breadth first recursion and the branch ... of D&C algorithms, one must make sure that there is sufficient memory allocated for the recursion ... that are time efficient often have relatively small recursion depth. For example, the quicksort algorithm ..., since many compilers assume that the recursion stack is a contiguous area of memory, and some allocate a fixed amount of space for it. Compilers may also save more information in the recursion stack ... cases , the small subproblems that are solved directly in order to terminate the recursion. Choosing ... could stop the recursion when the input is a single sample, and the quicksort list sorting ..., and it requires no processing. On the other hand, efficiency often improves if the recursion ... non recursive algorithms that, for those base cases, are more efficient than explicit recursion ... joining overhead is low. Note that these considerations do not depend on whether recursion is implemented ... of fixed sizes where the algorithm can be completely loop unwinding unrolled into code that has no recursion ... efficiently. ref name fftw The generalized version of this idea is known as recursion unrolling ... case. ref Radu Rugina and Martin Rinard, http people.csail.mit.edu rinard paper lcpc00.pdf Recursion ... repeated subproblems For some problems, the branched recursion may end up evaluating the same ... more details
Tony Ballantyne is a United Kingdom British Sci fi science fiction author known for his debut trilogy of novels, including Recursion novel Recursion , Capacity novel Capacity and Divergence . He is also Assistant Headteacher and an Information Technology teacher at The Blue Coat School, Oldham and has been nominated for the BSFA Award for short fiction. Bibliography Novels Recursion Trilogy Recursion novel Recursion , Macmillan, 2004 Capacity , Macmillan, 2005 Divergence book Divergence , Macmillan, 2007 The Robot Wars Penrose Twisted Metal , Macmillan, 2009 Blood and Iron , Macmillan, 2010 Short stories Takeaway originally published in Nature, issue March 19th 2009 Seeds originally published in the Anthology We Think Therefore We Are , edited by Peter Crowther DAW, 2009 Underbrain originally published in the anthology Subterfuge , edited by Ian Whates Newcon Press, 2008 Why are Rocks? originally published in Hub Issue 40, edited by Lee Harris Matthew s Passion with Eric Brown originally published in Kethani by Eric Brown Solaris, 2008 Third Person originally published in the anthology The Solaris Book of New Science Fiction , edited by George Mann Solaris, 2007 Reprinted in The Year s Best SF 13 , edited by David Hartwell and Kathryn Cramer Aristotle OS originally published in the anthology Fast Forward 1 , edited by Lou Anders PYR, 2007 Reprinted in THE YEAR s BEST SF 13, edited by David Hartwell and Kathryn Cramer The Exchange originally published in Postscripts 7 The Robot and the Octopus originally published in Nemonymous 5 A Matter of Mathematics originally published in the Anthology The Mammoth Book of Jules Verne Adventures , edited by Mike Ashley and Eric Brown Star originally published in the anthology Constellations , edited by Peter Crowther DAW, 2005 The Ugly Truth originally published in Interzone magazine Interzone 191 The Waters of Meribah originally published in Interzone magazine Interzone 189 Reprinted in THE YEAR s BEST SF 9, edited by David Hart ... more details
sometimes be treated in proofs in the same case as limit ordinals. Transfinite recursion Transfinite recursion is a method of constructing or defining something and is closely related to the concept ... formally, we can state the Transfinite Recursion Theorem as follows. Given a class function G V V , there exists ... types of ordinals separately another formulation of transfinite recursion is that given a set ... recursion on any well founded relation R . R need not even be a set it can be a proper ... or constructions using induction and recursion often use the axiom of choice to produce a well ordered ..., a construction by transfinite recursion frequently will not specify a unique value for A sub ... numbers Category Recursion Category Mathematical induction cs Transfinitn indukce de Transfinite Induktion ... more details
is well founded. Computer science allows for procedures to be defined by using recursion computer science recursion . Such definitions are not circular as long as they terminate. Dictionaries ... each other. Humorous Recursive Definition, so called A common joke is the following definition of recursion. ref cite web url http catb.org esr jargon html R recursion.html title recursion publisher Catb.org date accessdate 2010 04 07 ref Recursion See Recursion . This is a parody on circular references ... is the shortest possible example of an erroneous Recursion recursive definition of an object ... definition , this would be a vicious infinite regress. Newcomers to recursion are often bewildered ... more details
language Java applet draws a Sierpi ski curve by means of four methods that recursion recursively ... dist dist0 for int i level i 0 i dist 2 sg.goToXY 2 dist, dist sierpA level start recursion sg.lineRel dist, dist sierpB level start recursion sg.lineRel dist, dist sierpC level start recursion sg.lineRel dist, dist sierpD level start recursion sg.lineRel dist, dist private void sierpA int level if level ... Logo programming language Logo program draws a Sierpi ski curve by means of recursion . code ... curve List of fractals by Hausdorff dimension Recursion computer science Recursion computer ... more details
Infobox book name Higher Order Perl title orig translator image File Higher Order Perl front cover 2005.jpg thumb image caption The cover of Higher Order Perl author Mark Jason Dominus illustrator cover artist Yvo Riezebos country USA language English language English series subject Computer programming , Perl programming language publisher Morgan Kaufmann pub date 2005 media type print pages 600 isbn 1 558 60701 3 dewey 005.13 3 22 congress QA76.73.P22 D56 2005 oclc 56086063 preceded by followed by Higher Order Perl Transforming programs with programs , ISBN 1 558 60701 3 ISBN 978 1 558 60701 9 , is a book written by Mark Jason Dominus with the goal to teach Perl programmers with a strong C programming language C and Unix background how to use techniques with roots in functional programming languages like Lisp programming language Lisp that are available in Perl as well, but less known. The book is often referred to as HOP. The provisional title of HOP was Perl Advanced Techniques Handbook . The author has made the full text of HOP available in a derivative of Plain Old Documentation POD named http hop.perl.plover.com book MOD MOD , and in http hop.perl.plover.com book PDF PDF . Contents Recursion and callback s Dispatch table s cache computing Caching and memoization Iterator s From recursion to iterators lazy evaluation Infinite streams Higher order function s and currying Parsing Declarative programming External links official website hop.perl.plover.com Category Books about Perl Category Computer book stubs compu prog stub prog lang stub ... more details
Mergeto algorithm date September 2009 In computability theory , an effective method also called an effective procedure is a Procedure term procedure that reduces the solution of some class of problems to a series of rote steps which, if followed to the letter, and as far as may be necessary, is bound to always give some answer rather than ever give no answer always give the right answer and never give a wrong answer always be completed in a finite number of steps, rather than in an infinite number work for all instances of problems of the class. An effective method for calculating the values of a function is an algorithm functions with an effective method are sometimes called effectively calculable . Several independent efforts to give a formal characterization of effective calculability led to a variety of proposed definitions Recursion general recursion , Turing machine s, calculus that later were shown to be equivalent the notion captured by these definitions is known as Computable function recursive computability . Church s thesis states that the two notions coincide any number theoretic function that is effectively calculable is computable function recursively computable . Church s thesis is not a mathematical statement and cannot be proved by a mathematical proof . A further elucidation of the term effective method may include the requirement that, when given a problem from outside the class for which the method is effective, the method may halt or loop forever without halting, but must not return a result as if it were the answer to the problem. An essential feature of an effective method is that it does not require any ingenuity from any person or machine executing it. ref The Cambridge Dictionary of Philosophy, effective procedure ref See also Decidability logic Decision problem Function problem Effective results in number theory Recursive set Undecidable problem References reflist S. C. Kleene 1967 , Mathematical logic . Reprinted, Dover, 2002, ISBN 0 48 ... more details
In mathematics , Hermite numbers are values of Hermite polynomials at zero argument. Typically they are defined for physicists Hermite polynomials. Formal definition The numbers H sub n sub H sub n sub 0 , where H sub n sub x is a Hermite polynomial of order n , may be called Hermite numbers. ref name HN1 Weisstein, Eric W. Hermite Number. From MathWorld A Wolfram Web Resource. http mathworld.wolfram.com HermiteNumber.html ref The first Hermite numbers are math H 0 1 , math math H 1 0 , math math H 2 2 , math math H 3 0 , math math H 4 12 , math math H 5 0 , math math H 6 120 , math math H 7 0 , math math H 8 1680 , math math H 9 0 , math math H 10 30240 , math Recursion relations Are obtained from recursion relation s of Hermitian polynomials for x 0 math H n 2 n 1 H n 2 . , math Since H sub 0 sub 1 and H sub 1 sub 0 one can construct a closed formula for H sub n sub math H n begin cases 0, & mbox if n mbox is odd 1 n 2 2 n 2 n 1 , & mbox if n mbox is even end cases math where n 1 1 × 3 × ... × n 1 . Usage From the generating function of Hermitian polynomials it follows that math exp t 2 sum n 0 infty H n frac t n n , math Reference ref name HN1 gives a formal power series math H n x H 2x n , math where formally the n th power of H , H sup n sup , is the n th Hermite number, H sub n sub . See Umbral calculus . Notes references Category Integer sequences ... more details
Encyclopedia
top
