Listing 1 - 10 of 10 |
Sort by
|
Choose an application
Complex analysis --- Mathematical logic --- Computable functions. --- Functionals. --- Recursion theory. --- Logique mathématique --- Récursivité, Théorie de la
Choose an application
Choose an application
Choose an application
This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers. .
Computer Science --- Engineering & Applied Sciences --- Computable functions. --- Computer science --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Mathematics --- Computer science. --- Computers. --- Computer Science. --- Theory of Computation. --- Mathematics of Computing. --- Constructive mathematics --- Decidability (Mathematical logic) --- Information theory. --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Computer science—Mathematics. --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Machine theory --- Calculators --- Cyberspace
Choose an application
This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers. .
Mathematics --- Computer science --- Computer. Automation --- toegepaste informatica --- computers --- informatica --- externe fixatie (geneeskunde --- wiskunde
Choose an application
Mathematical logic --- Algebra --- Complex analysis --- Discrete mathematics --- Computer science --- Computer architecture. Operating systems --- algebra --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- wiskunde
Choose an application
This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011.The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%. The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.
Mathematical logic --- Algebra --- Complex analysis --- Discrete mathematics --- Computer science --- Computer architecture. Operating systems --- algebra --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- wiskunde
Choose an application
Choose an application
Choose an application
Listing 1 - 10 of 10 |
Sort by
|