Cryptographic Limitations on Learning Boolean Formulae and Finite Automata

Chapter 18 Strategic directions in machine learning

Chapter 19 Introduction

Chapter 20 Training a 3-node neural network is NP-complete

Chapter 21 Cryptographic limitations on learning Boolean formulae and finite automata

Chapter 22 Inference of finite automata using homing sequences

Chapter 23 Introduction

Chapter 24 Adaptive search by learning from incomplete explanations of failures

Chapter 25 Learning of rules for fault diagnosis in power supply networks

Chapter 26 Cross references are features

Chapter 27 The schema mechanism

Chapter 29 Introduction

Chapter 30 Massively parallel symbolic induction of protein structure/function relationships

Chapter 31 Task decomposition through competition in a modular connectionist architecture: The what and where vision tasks

Chapter 32 Phoneme discrimination using connectionist networks

Chapter 33 Behavior-based learning to control IR oven heating: Preliminary investigations

Chapter 34 Trellis codes, receptive fields, and fault tolerant, self-repairing neural networks