Naval Postgraduate School
Dudley Knox Library
NPS Dudley Knox Library
View Item 
  •   Calhoun Home
  • Reports and Technical Reports
  • All Technical Reports Collection
  • View Item
  •   Calhoun Home
  • Reports and Technical Reports
  • All Technical Reports Collection
  • View Item
  • How to search in Calhoun
  • My Accounts
  • Ask a Librarian
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of CalhounCollectionsThis Collection

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

Field computation and nonpropositional knowledge

Thumbnail
Download
Iconfieldcomputation00macl.pdf (1.910Mb)
Download Record
Download to EndNote/RefMan (RIS)
Download to BibTex
Author
MacLennan, Bruce J.
Date
1987-09
Metadata
Show full item record
Abstract
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
 
Most current AI technology has been based on proposition ally represented theoretical knowledge. We argue 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 from 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, moleculax computers, and any kind of massively parallel analog computer. We claim that the principle characteristic of all these computers is their massive parallelism, but we use this term in a special way. We argue 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. We describe 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.
 
URI
http://hdl.handle.net/10945/25943
NPS Report Number
NPS52-87-040
Collections
  • All Technical Reports Collection
  • Other Technical Reports

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    The minimization of multiple valued logic expressions using parallel processors 

    Oral, Sabri Onur (Monterey, California. Naval Postgraduate School, 1991-09);
    The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood ...
  • Thumbnail

    Scheduling Resources in Multi-User Heterogeneous Computing Environments with SmartNet 

    Freund, Richard F.; Gherrity, Michael; Ambrosius, Stephen; Campbell, Mark; Halderman, Mike; Hensgen, Debra Z.; Keith, Elaine; Kidd, Taylor; Kussow, Matt; Lima, John D.; Mirabile, Francesca; Moore, Lantz; Rust, Brad; Siegel, H.J. (1998);
    It is increasingly common for computer users to have access to several computers on a network, and hence tobe able to execute many of their tasks on any of several computers. The choice of which computers execute which ...
  • Thumbnail

    Desirable properties of a network taxonomy 

    McCoy, Earl E.; Carey, Bernard J. (Monterey, California. Naval Postgraduate School, 1980-05); NPS-52-80-007
    This paper reviews and analyzes the desirable properties of a computer network taxonomy from the point of view of its usefulness in a design procedure. A key factor that must be considered is that the design environment ...
NPS Dudley Knox LibraryDUDLEY KNOX LIBRARY
Feedback

411 Dyer Rd. Bldg. 339
Monterey, CA 93943
circdesk@nps.edu
(831) 656-2947
DSN 756-2947

    Federal Depository Library      


Start Your Research

Research Guides
Academic Writing
Ask a Librarian
Copyright at NPS
Graduate Writing Center
How to Cite
Library Liaisons
Research Tools
Thesis Processing Office

Find & Download

Databases List
Articles, Books & More
NPS Theses
NPS Faculty Publications: Calhoun
Journal Titles
Course Reserves

Use the Library

My Accounts
Request Article or Book
Borrow, Renew, Return
Tech Help
Remote Access
Workshops & Tours

For Faculty & Researchers
For International Students
For Alumni

Print, Copy, Scan, Fax
Rooms & Study Spaces
Floor Map
Computers & Software
Adapters, Lockers & More

Collections

NPS Archive: Calhoun
Restricted Resources
Special Collections & Archives
Federal Depository
Homeland Security Digital Library

About

Hours
Library Staff
About Us
Special Exhibits
Policies
Our Affiliates
Visit Us

NPS-Licensed Resources—Terms & Conditions
Copyright Notice

Naval Postgraduate School

Naval Postgraduate School
1 University Circle, Monterey, CA 93943
Driving Directions | Campus Map

This is an official U.S. Navy Website |  Please read our Privacy Policy Notice  |  FOIA |  Section 508 |  No FEAR Act |  Whistleblower Protection |  Copyright and Accessibility |  Contact Webmaster

Export search results

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

A logged-in user can export up to 15000 items. If you're not logged in, you can export no more than 500 items.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.