In outline Scott argues as follows: It is … or information contents. … If a function is to be well behaved, … If a function is to be computable, it … approximate its result by giving … information about its arguments. … These two conditions lead to the idea that … Scott was then able to construct … D= [D > d].
Google-1
Google-2
Copyright clearance needed for quotation.