| t e a c h i n g | ||||||||
| 4. 2 1 7 P r o - s e m i n a r i n D e s i g n a n d C o m p u t a t i o n | ||||||||
| M a s s a c h u s e t t s I n s t i t u t e o f T e c h n o l o g y | ||||||||
| Semester: Fall 2003
Readings: Sotirios Kotsopoulos Lecture: Tuesday 2:30 – 5:30 pm INTRODUCTION Hamming R. W., “Mathematics on a Distant Planet”, Proceedings of the American Mathematical Society, pp, 640-650, August- September 1998 TURING MACHINES Lewis H. R., Papadimitriou C. H. ‘Turing Machines’, from the Elements of the theory of computation, Prentice-Hall, 1998, pp. 179-200 Boolos G., Jeffrey R., ‘Turing machines’, from Computability and Logic, Cambridge University Press, pp. 19-33, (1974), 1989 Turing A. M., “Computing machinery and intelligence”, from Computers and Thought, ed. by E. Feigenbaum, 1963, pp. 11-35, PRODUCTION SYSTEMS Minsky M., ‘The symbol-manipulation systems of Post’, Computation: Finite and infinite machines, 1967, pp. 219-254, Prentice-Hall Gips J., Stiny G., ‘Production systems and grammars: a uniform characterization’, Environment and Planning B, 1980, vol. 7, pp. 399-408 PHRASE STRUCTURE GRAMMARS Chomsky N., ‘Formal Properties of Grammars’, from the Handbook of Mathematical Psychology, 1963, voll. II, ch., 12, pp. 323- 418 Lewis H. R., Papadimitriou C. H. ‘Context-Free Languages’, from the Elements of the theory of computation, Prentice-Hall, 1998, pp. 113-142 DESIGN THEORY Stiny G., ‘The algebras of design’, Research in Engineering Design 2(3), 1991, pp. 171-181 March, L., ‘A boolean description of a class of built forms’, The Architecture of the Form, Cambridge University Press, 1976, pp. 41-73 Stiny G., and March L., ‘Design Machines’ Environment and Planning B 8 1981, pp. 91-104 Gero J. S., ‘Design Prototypes: A knowledge representation scheme in design’, AI Magazine, 1990, 11(4), pp. 26-36 |
||||||||
| back | ||||||||