Field computation and nonpropositional knowledge - Info and Reading Options
By Bruce J. MacLennan

"Field computation and nonpropositional knowledge" was published by Naval Postgraduate School in 1987 - Monterey, California, it has 34 pages and the language of the book is English.
“Field computation and nonpropositional knowledge” Metadata:
- Title: ➤ Field computation and nonpropositional knowledge
- Author: Bruce J. MacLennan
- Language: English
- Number of Pages: 34
- Publisher: Naval Postgraduate School
- Publish Date: 1987
- Publish Location: Monterey, California
“Field computation and nonpropositional knowledge” Subjects and Themes:
- Subjects: Optical Computers - Neural computers - Artificial intelligence - Molecular computers
Edition Specifications:
- Pagination: 34 p. :
Edition Identifiers:
- The Open Library ID: OL25498492M - OL16875955W
- Online Computer Library Center (OCLC) ID: 436872311
AI-generated Review of “Field computation and nonpropositional knowledge”:
"Field computation and nonpropositional knowledge" Description:
The Open Library:
Most current AI technology has been based on propositionally represented theoretical knowledge. It is argued that if AI is to accomplish its goals, especially in the tasks of sensory interpretation and sensorimotor coordination, then it must solve the problem of representing embodied practical knowledge. Biological evidence shows that animals use this knowledge in a way very different form digital computation. This suggests that if these problems are to be solved, then we will need a new breed of computers, which we call field computers. Examples of field computers are: neurocomputers, optical computers, molecular computers, and any kind of massively parallel analog computer. The author claims that the principle characteristic of all these computers is their massive parallelism, but we use this term in a special way. He argues that true massive parallelism comes when the number of processors is so large that it can be considered a continuous quantity. Designing and programming these computers requires a new theory of computation, one version of which is presented in this paper. Described is a universal field computer, that is, a field computer that can emulate any other field computer. It is based on a generalization of Taylor's theorem to continuous dimensional vector spaces. A number of field computations are illustrated, including several transformations useful in image understanding, and a continuous version of Kosko's bidirectional associative memory.
Read “Field computation and nonpropositional knowledge”:
Read “Field computation and nonpropositional knowledge” by choosing from the options below.
Search for “Field computation and nonpropositional knowledge” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Field computation and nonpropositional knowledge" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Field computation and nonpropositional knowledge” in Libraries Near You:
Read or borrow “Field computation and nonpropositional knowledge” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Field computation and nonpropositional knowledge” at a library near you.
Buy “Field computation and nonpropositional knowledge” online:
Shop for “Field computation and nonpropositional knowledge” on popular online marketplaces.
- Ebay: New and used books.