Comments on "Defining Software by Continuous Smooth Functions''
暂无分享,去创建一个
The commenter agrees with R.A. De Millo and R.S. Lipton's assertion in the above-titled work (see ibid., vol.17, no.4, p.383-4, 1991) that continuous, smooth functions of comparable complexity can be used to represent Boolean functions computed by programs. The commenter reconciles this assertion with a referee's objection that the discontinuity of software resides in the large changes of behavior that results from small changes of code, which was countered by the authors by arguing that this notion of discontinuity is vague. It is suggested that this vagueness can be remedied if discontinuity is replaced by a more natural measure that nevertheless captures a similar intuition. >
[1] S. Fomin,et al. Elements of the Theory of Functions and Functional Analysis , 1961 .
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Joe Stoy,et al. Denotational Semantics , 1977 .
[4] Richard J. Lipton,et al. Defining Software by Continuous, Smooth Functions , 1991, IEEE Trans. Software Eng..
[5] Ivan Bratko,et al. Prolog Programming for Artificial Intelligence , 1986 .