Distributed and Parallel Computing
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes', 'PO_EMAI': None, 'PO_PHON': None}
There are two foci of this proposal.  First, research on fundamental            models                                                                          of distributed computing will be continued. The foundations of                  communication                                                                   protocols will be investigated using game automata, logics of knowledge         and                                                                             time, and other suitable tools.  The long range goal is to help develop         mathematical models and theories for protocols which will have the same         footing as the current accepted mathematical models and theories have           for                                                                             sequential and parallel models.  The second focus is to begin a new             research                                                                        effort into the connectionist models of computation.  There is hope,            and                                                                             even some evidence, that the new connectionist models will                      revolutionize                                                                   the way we compute.  There are a number of obvious differences between          traditional models of computation and connectionist models.  The goal           of                                                                              this research is to investigate how deep these differences are.  A              comparison                                                                      of the traditional parallel models of computation and the connectionist         models                                                                          will be used to determine if indeed the connectionist models are                an improvement over the traditional ones.
{'FirstName': 'Richard', 'LastName': 'Ladner', 'PI_MID_INIT': 'E', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Richard E Ladner', 'EmailAddress': 'ladner@cs.washington.edu', 'NSF_ID': '000438222', 'StartDate': '12/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Washington', 'CityName': 'SEATTLE', 'ZipCode': '981951016', 'PhoneNumber': '2065434043', 'StreetAddress': '4333 BROOKLYN AVE NE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Washington', 'StateCode': 'WA', 'CONGRESSDISTRICT': '07', 'CONGRESS_DISTRICT_ORG': 'WA07', 'ORG_UEI_NUM': 'HD1WMN6945W6', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF WASHINGTON', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8714782.xml'}