Can I read Super-Recursive Algorithms (Monographs in Computer Science) on EtoBox?

Super-Recursive Algorithms (Monographs in Computer Science) by M S Burgin is a nonfiction available to read on EtoBox.

What is Super-Recursive Algorithms (Monographs in Computer Science) about?

Computational semantics is the art and science of computing meaning in natural language. The meaning of a sentence is derived from the meanings of the individual words in it, and this process can be made so precise that it can be implemented on a computer. Designed for students of linguistics, computer science, logic and philosophy, this comprehensive text shows how to compute meaning using the functional programming language Haskell. It deals with both denotational meaning (where meaning comes from knowing the conditions of truth in situations), and operational meaning (where meaning is an instruction for performing cognitive action). Including a discussion of recent developments in logic, it will be invaluable to linguistics students wanting to apply logic to their studies, logic students wishing to learn how their subject can be applied to linguistics, and functional programmers interested in natural language processing as a new application area Provides an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. This book demonstrates how these algorithms are

Who reads Super-Recursive Algorithms (Monographs in Computer Science)?

Author

M S Burgin

Publisher

Springer Science+Business Media Inc

Published

2005

Language

EN

ISBN

9780387955698

Category

nonfiction

Subjects

Mathematics, Engineering, Computer Science

Rating

2.33 / 5 (3 ratings)

Updated

2026-03-13