Information Processing, Proceedings of the International Conference on Information Processing, UNESCO, Paris 15-20 June 1959. Published in 1960 by UNESCO (Paris), R. Oldenbourg (München) and Butterworths (London)

• 
  Réne Maheu, Howard H. Aiken, André Danjon, Pierre Auger, Hughes Vinel: Inaugural addresses. 17-24
• 
  Howard H. Aiken: Closing Speech. 25-28

Chapter 1: Methods of digital computing

• 
  J. Kuntzmann: Introductory Speech. 31-32
• 
  F. Ceschino, J. Kuntzmann: Faut-il passer à la forme canonique dans les problèmes différentielles de conditions initiales? 33-35
• 
  Peter Henrici: Theoretical and experimental studies on the accumulation of error in the numerical solution of initial value problems for systems of ordinary differential equations. 36-43
• 
  James Hardy Wilkinson: Rounding errors in algebraic processes. 44-53
• 
  Ch. Blanc: Sur l'estimation des erreurs d'arrondi. 54-56
• 
  Hans J. Maehly: Rational approximations for transcendental functions. 57-61
• 
  D. B. Gillies: The exact determination of the characteristic polynominal of a matrix. 62-65
• 
  A. A. Dorodnitzin: The use of high-speed digital computers for solving partial differential equations. 66-71
• 
  Lothar Collatz: Methods for the solution of partial differential equations on digital computers. 72-78
• 
  D. J. Evans: The solution of elliptic difference equations by stationary iterative processes. 79-84
• 
  Richard S. Varga: Over-relaxation applied to implicit alternating direction methods. 85-89
• 
  G. Letellier, R. Lattes: Résolution sur calculateur électronique d'un problème d'algèbre diophantienne. 90-92
• 
  G. R. Parisot: Les programmes logarithmiques - application au calcul des programmes convexes, spécialement linéaires. 93-98
• 
  S. Vajda: Symposium on linear programming. 99-101
• 
  R. Sauer: Colloque sur l'analyse numérique sur calculatrices automatiques. 102-107
• 
  T. H. Wilkinson: Symposium on methods for solving linear systems. 108-114

Chapter 2: Common symbolic language for computers

• 
  Saul Gorn: Introductory speech. 117-118
• 
  Friedrich L. Bauer, Klaus Samelson: The problem of a common language, especially for scientific numeral work. 120-124
• 
  John W. Backus: The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference. 125-131
• 
  J. Poyen, Bernard Vauquois: A propos d'un langage universel. 132-137
• 
  I. Y. Akushsky, Yu. Y. Basilevsky, Yu. A. Shreider: Logical, recursive and operator methods for the analysis and synthesis of automata. 138-143
• 
  F. G. Duncan, E. N. Hawkins: Pseudo-code translation on multi-level storage machines. 144-151
• 
  Alan J. Perlis: Symposium on automatic programming. 152-156

Chapter 3: Automatic translation of languages

• 
  D. Panov: Introductory speech. 159-161
• 
  Vincent E. Giuliano, Anthony G. Oettinger: Research on automatic translation at the Harvard Computation Laboratory. 163-182
• 
  Victor H. Yngve: The COMIT system for mechanical translation. 183-187
• 
  Kenneth E. Harper, David G. Hays: The use of machines in the construction of a grammar and computer program for structural analysis. 188-193
• 
  R. Tadenuma, S. Watanabe: English-Japanese machine translation. 194-198
• 
  I. K. Belskaya: Machine translation methods and their application to an Anglo-Russian scheme. 199-217
• 
  David G. Hays: Symposium on machine translation. 218-220

Chapter 4: Pattern recognition and machine learning

• 
  Karl Steinbuch: Introductory speech. 223-225
• 
  Y. Okumura, K. Imoto: An electronic reading machine. 227-231
• 
  H. Sherman: A quasi-topological method for the recognition of line patterns. 232-237
• 
  W. Sprick, Karl E. Ganzhorn: An analogous method for pattern recognition by following the boundary. 238-243
• 
  H. Kazmierczak: The potential field as an aid to character recognition. 244-247
• 
  S. Frankel: Information-theoretic aspects of character reading. 248-251
• 
  George W. Hughes, Morris Halle: On the recognition of speech by machine. 252-255
• 
  Allen Newell, J. C. Shaw, Herbert A. Simon: Report on a general problem-solving program. 256-264
• 
  Paul C. Gilmore: A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus. 265-272
• 
  H. Gelernter: Realization of a geometry theorem proving machine. 273-281
• 
  B. Dunham, R. Fridshal, G. L. Sward: A non-heuristic program for proving elementary logical theorems. 282-284
• 
  Ray J. Solomonoff: A new method for discovering the grammars of phrase structure languages. 285-289
• 
  David G. Willis: Plastic neurons as memory elements. 290-297
• 
  S. N. Braines, A. V. Napalkov, Yu. A. Shreider: Analysis of the working principles of some self-adjusting systems in engineering and biology. 298-302
• 
  T. Kilburn, R. L. Grimsdale, F. H. Sumner: Experiments in machine learning and thinking. 303-308
• 
  M. E. Stevens: A machine model of recall. 309-314
• 
  Calvin N. Mooers: Some mathematical fundamentals of the use of symbols in information retrieval. 315-320
• 
  A. F. Parker-Rhodes, Roger M. Needham: A reduction method for non-arithmetic data, and its application to thesauric translation. 321-325
• 
  Karl Steinbuch: Closing remarks. 326-328

Chapter 5: Logical design of computers

• 
  Maurice V. Wilkes: Introductory speech. 331-333
• 
  Christopher Strachey: Time sharing in large, fast computers. 336-341
• 
  B. J. Loopstra: Input and output in the X-1 system. 342-343
• 
  W. F. Schmitt, A. B. Tonik: Sympathetically programmed computers. 344-347
• 
  J. Bosset: Sur certain aspects de la conception logique du Gamma 60. 348-352
• 
  Alan L. Leiner, W. A. Notz, J. L. Smith, Rosalind B. Marimont: Concurrently operating computer systems. 353-360
• 
  W. L. van der Poel: Zebra, a simple binary computer. 361-364
• 
  M. M. Lehman: The specification of a cost-limited digital computer. 365-374
• 
  Frederick P. Brooks Jr., Gerrit A. Blaauw, Wilfried Buchholz: Processing data in bits and pieces. 375-381
• 
  I. Y. Akushsky, L. B. Emelianow-Yaroslavsky, E. A. Klyamko, V. S. Linsky, G. D. Monakhov: Methods of speeding-up the operation of digital computers. 382-388
• 
  Gernot Metze, James E. Robertson: Elimination of carry propagation in digital computers. 389-395
• 
  H. Takahasi, Eiichi Goto: Application of error-correcting codes to multi-way switching. 396-399
• 
  Saburo Muroga: The principle of majority decision logical elements and the complexity of their circuits. 400-406
• 
  Roberto Vacca: A three-valued system of logic and its application to base three digital circuits. 407-413
• 
  G. C. Tootill: The use of cyclic-permuted chain codes for digitisers. 414-418
• 
  Antonin Svoboda: The numerical system of residual classes in mathematical machines. 419-421
• 
  M. Goto: Symposium on switching algebra. 422-426
• 
  W. L. van der Poel: Symposium on the logical organization of very small computers. 427-431
• 
  N. G. Metropolis: Symposium on the logical organization of very high speed computers. 432-436

Chapter 6: Special session on computer techniques of the future

• 
  S. Methfessel, Walter E. Proebster, C. Kinberg: Thin magnetic films. 439-446
• 
  J. Raffel, D. O. Smith: A computer memory using magnetic film. 447-454
• 
  W. B. Ittner III: Physical characteristics of cryogenic components. 455-460
• 
  H. E. Billing, A. O. Rüdiger: The possibility of speeding up computers using parametrons. 461-465
• 
  J. W. Leas: Microwave solid-state techniques for high speed computers. 466-473
• 
  D. A. Buck, Kenneth R. Shoulders: An approach to microminiature printed systems. 474-478
• 
  G. W. King: Symposium on the influence of very large memory designs and capabilities on information retrieval. 479-484

Chapter 7: Miscellaneous topics

• 
  J. Carteron: Colloque sur les relations du calcul analogique et du calcul arithmétique. 485-486
• 
  Richard Wesley Hamming: Symposium on error detection and correction. 487-491
• 
  B. W. Adkinson: Symposium on the collection, storage and retrieval of information. 492-498