The mind at AI: Horseless carriage to clock
WC Hill - AI Magazine, 1989 - ojs.aaai.org
Commentators on AI converge on two goals they believe define the field:(1) to better
understand the mind by specifying computational models and (2) to construct computer …
understand the mind by specifying computational models and (2) to construct computer …
Probabilistic computation and linear time
L Fortnow, M Sipser - Proceedings of the twenty-first annual ACM …, 1989 - dl.acm.org
In this paper, we give an oracle under which BPP is equal to probabilistic linear time, an
unusual collapse of a complexity time hierarchy. In addition, we also give oracles where ΔP2 …
unusual collapse of a complexity time hierarchy. In addition, we also give oracles where ΔP2 …
Using Fifth Generation Tools for Solving the Clique Number Problem
JC Panayiotopoulos - Journal of Information and Optimization …, 1989 - Taylor & Francis
An expert system based on rules, synchronizes a parallel (or single) computation model in
which p (p= 1, 2,…) processors have access to a common “pilot” disk file. Given n the size of …
which p (p= 1, 2,…) processors have access to a common “pilot” disk file. Given n the size of …
A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes
J Seiferas, DT Huynh, JG Geske - 1989 - urresearch.rochester.edu
For each time bound T:{input strings}-->{natural numbers} that is some machine's exact
running time, there is a {O, 1}-valued function fT that can be computed within time …
running time, there is a {O, 1}-valued function fT that can be computed within time …