



SuperRecursive Algorithms (Monographs in Computer Science)
This book introduces the new realm of superrecursive algorithms and the development
of mathematical models for them. Although many still believe that only recursive
algorithms exist and that only some of them are realizable, there are many
situations in which people actually work with superrecursive algorithms....     The Nature of Code: Simulating Natural Systems with Processing
How can we capture the unpredictable evolutionary and emergent properties of nature in software? How can understanding the mathematical principles behind our physical world help us to create digital worlds? This book focuses on a range of programming strategies and techniques behind computer simulations of natural systems, from elementary... 



Foundations of Computing
It may sound surprising that in computing, a field which develops so fast that the future often becomes the past without having been the present, there is nothing more stable and worthwhile learning than its foundations.
It may sound less surprising that in a field with such a revolutionary methodological impact on all sciences and...   Mathematical Models of Spoken LanguageHumans use language to convey meaningful messages to each other. Linguistic competence consists in the ability to express meaning reliably, not simply to obtain faithful lexical transcriptions. This invaluable reference tool is the product of many years' experience and research on language and speech technology. It presents the motivations for,...   Automated Reasoning: 4th International Joint Conference, IJCAR 2008, Sydney, NSW, Australia, August 1215, 2008, ProceedingsThis book constitutes the refereed proceedings of the 4th International Joint Conference on Automated Reasoning, IJCAR 2008, held in Sydney, Australia, in August 2008. The 26 revised full research papers and 13 revised system descriptions presented together with 4 invited papers and a summary of the CASCJ4 systems competition were carefully... 


Result Page: 10 9 8 7 6 5 4 3 2 1 