Limited computation, unlimited design

被引:0
|
作者
Protzen, JP [1 ]
Harris, D [1 ]
Cavallin, H [1 ]
机构
[1] Univ Calif Berkeley, Berkeley, CA 94720 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many problems cannot by solved by computation, among them are design problems. While some non-computable problems simply exceed practical amounts of computation, the difficulty with design problems does not primarily lie in the realm practical computation limits. Even considering that the application of algorithms might be quite fruitful in some stages of the problem solving, computation can only start being useful in the pursuing of solutions once the designer has formulated the design problem. However, developing such problem statement is not only an exceedingly important but difficult task. This paper discusses the central role that the designer's own epistemic freedom has in the formulation of such design problems.
引用
收藏
页码:43 / 52
页数:10
相关论文
共 50 条