Skip to main content

previous disabled Page of 22,389
and
  1. No Access

    Chapter

    Circuitry of Clues to Platonic Ideation

    First of all, I wish to apologize for this somewhat pompous title, but I hope that at the end of my talk you will have forgiven me for having invoked Plato’s esoteric ideas in order to embellish the thoughts b...

    Heinz Von Foerster in Aspects of the Theory of Artificial Intelligence (1962)

  2. No Access

    Chapter

    Logisticon

    Any logical function of n arguments can be represented by a single Venn diagram, each of whose spaces contains a 0 or 1 in Boolean fashion. Using 1 for true and 0 for false they constitute the truth table of t...

    Warren S. McCulloch in Aspects of the Theory of Artificial Intelligence (1962)

  3. No Access

    Chapter

    The Simulation of Learning and Decision-Making Behavior

    In this paper we examine the peculiar difficulties of simulating the learning behavior of man, certain animals, and those mechanical artifacts in which forms of organization evolve.

    Gordon Pask in Aspects of the Theory of Artificial Intelligence (1962)

  4. No Access

    Book

    Aspects of the Theory of Artificial Intelligence

    The Proceedings of the First International Symposium on Biosimulation Locarno, June 29 – July 5, 1960

    C. A. Muses Ph.D. (1962)

  5. No Access

    Chapter

    Learning in a Nondigital Environment

    Machines which simulate animal learning have been described by Uttley [13, 14] with his conditional probability computer, Walter [16] with his conditioned reflex analogue, and many others including Selfridge [...

    Alex M. Andrew in Aspects of the Theory of Artificial Intelligence (1962)

  6. No Access

    Chapter

    Storage and Manipulation of Information in Random Networks

    Innumerable questions can be asked in relation to the brain. How does it work? How should a “thinking machine” work? How is it that there is in the universe the consistency which makes a “thinking machine” pos...

    R. L. Beurle in Aspects of the Theory of Artificial Intelligence (1962)

  7. No Access

    Chapter

    Theoretical Models of Space Perception

    How can we characterize perceptual activity from the standpoint of information theory? There are obviously several lines of approach. First, functionally, we may consider perception as the organism’s answer to th...

    Donald M. MacKay in Aspects of the Theory of Artificial Intelligence (1962)

  8. No Access

    Chapter

    The Logic of Biosimulation

    Delimiting the key word of our title, we can more specifically confine ourselves and speak of the logic of anthroposimulation, the most advanced type of biosimulation possible, since man is the highest known l...

    Charles Arthur Muses in Aspects of the Theory of Artificial Intelligence (1962)

  9. No Access

    Chapter

    Random Assembly of Logical Elements

    Since the notion of random and randomness repeatedly arises in the field we are discussing, I thought that maybe it would be of some interest to build examples of what may happen in certain circumstances when ...

    M. Paul Schützenberger in Aspects of the Theory of Artificial Intelligence (1962)

  10. No Access

    Chapter

    On Microelectronic Components, Interconnections, and System Fabrication

    Microelectronic data processing systems are analyzed and various requirements for components are considered. The rapid reduction in transmission line cross section upon scaling down causes increased losses in ...

    Kenneth R. Shoulders in Aspects of the Theory of Artificial Intelligence (1962)

  11. No Access

    Chapter

    The Self-Reproducing System

    High among the interesting phenomena of organization shown by life is that of reproduction. We are naturally led to ask: How can a system reproduce itself? And we go headlong into a semantic trap unless we pro...

    W. Ross Ashby in Aspects of the Theory of Artificial Intelligence (1962)

  12. No Access

    Article

    Über die Approximation asymptotischer Entwicklungen I

    Für einige Typen linearer homogener Differentialgleichungen werden an Stelle der asymptotischen Entwicklungen für große Werte der unabhängigen Variablenx Approximationen im gleichmäßigen Sinne aus der Differentia...

    Professor Dr. G. Meinardus in Computing (1966)

  13. No Access

    Article

    Adaptive control via quasilinearization and differential approximation

    Suppose that a system undergoes a process described by a set of differential equations. The equations contain some unknown parameters and not all the initial conditions are known. Observations are made on some...

    R. Bellman, R. Kalaba, R. Sridhar in Computing (1966)

  14. No Access

    Article

    Verallgemeinerung funktionentherotischer Verfahren für Analogrechner auf allgemeinere Funktionentheorien

    Zur Untersuchung der Abbildungseigenschaften analytischer Funktionen gibt es bekannte Verfahren für einen Analogrechner. Diese Verfahren werden in der vorliegenden Arbeit auf den Fall einer allgemeineren Funkt...

    Dr. N. Apostolatos in Computing (1966)

  15. No Access

    Article

    Zertifikat zu Algorithmus 1 Cholbd [H. Rutishauser, Computing 1 (1966)]

    F. Nake in Computing (1966)

  16. No Access

    Article

    Buchbesprechungen

    H. Kremser, W. Knödel, L. Collatz, W. Eberl, H. Beilner, E. Bukovics in Computing (1966)

  17. No Access

    Article

    Über das Transportproblem mit beliebigen zusätzlichen linearen Nebenbedingungen

    Das klassische Transportproblem wurde durch zusätzliche Bedingungen ergänzt, die in Form beliebiger linearer Gleichungen oder Ungleichungen vorgegeben sind und allenfalls auch zusätzliche Variable beinhalten k...

    Dr. P. Meissl Dozent am in Computing (1966)

  18. No Access

    Article

    Ein Verfahren zur Identifizierung von Zeichen, deren Wiedergabe stationären statischen Störungen unterworfen ist

    SeiE={e 1, ...,e m } eine Menge zufälliger Ereignissee i , die mit den WahrscheinlichkeitenP i auftreten....

    Dr. R. Albrecht, Dr. W. Werner in Computing (1966)

  19. No Access

    Article

    Block-stochastic matrices and associated finite-state languages

    Finite automata are considered whose transition matrix is blockstochastic. The block-stochastic structure defines an equivalence relation among states of the automata. The implications of this relation are inv...

    Dr. phil. W. Kuich, Dipl.-Ing. Dr. techn. K. Walk in Computing (1966)

  20. No Access

    Article

    Algorithmus 1 Lineares Gleichungssystem mit symmetrischer positivdefiniter Bandmatrix nach CHOLESKY

    H. Rutishauser in Computing (1966)

previous disabled Page of 22,389