Simulation Studies of Tornadic Vortices
{'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}
Insightful characterizations of the power of various machine self-              reference principles, both in the context of universal programming              systems and clocked systems, are sought with an eye to determining what         use is self-knowledge (for programs).  It is expected that machine              self-knowledge is useful for machine self-modification (learning).              Characterizations or strong sufficient conditions are sought especially         for those self-reference principles which are algebraically well-               behaved.  Conditions are sought for validity of the principle that, if          there is no self-referential counterexample to a proposition, the               proposition is true.  A rigorous mathematical solution is sought to the         problem of why machine self-reference proofs lay bare an underlying,            simplest reason for the theorems they prove.                                                                                                                                                                                                    In the context of machine learning theory the P.I. is studying the              effects of imposing complexity and succinctness constraints on final            programs and grammars learned, the power of (formal) language learning          machines if they converge on a small, uniformly, bounded, finite number         of grammars, and the relationship of these and other matters to                 separability by sets enumerable by effective procedures which, in               effect, change their "minds" finitely often.  The tradeoffs between             complexity of subrecursive text and speed of the inference progress are         being investigated.                                                                                                                                             In relatively small community applying recursion theory in computer             science the P.I. is regarded as a leading figure.
{'FirstName': 'John', 'LastName': 'Case', 'PI_MID_INIT': 'W', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'John W Case', 'EmailAddress': 'case@cis.udel.edu', 'NSF_ID': '000387627', 'StartDate': '09/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'SUNY at Buffalo', 'CityName': 'AMHERST', 'ZipCode': '142282577', 'PhoneNumber': '7166452634', 'StreetAddress': '520 LEE ENTRANCE STE 211', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '26', 'CONGRESS_DISTRICT_ORG': 'NY26', 'ORG_UEI_NUM': 'LMCJKRFW5R81', 'ORG_LGL_BUS_NAME': 'RESEARCH FOUNDATION FOR THE STATE UNIVERSITY OF NEW YORK, THE', 'ORG_PRNT_UEI_NUM': 'GMZUKXFDJMA9'}
{'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': '8713846.xml'}