🚀 go-pugleaf

In article <1992Nov13.084826.26088@daimi.aau.dk> pdm@daimi.aau.dk (Peter D. Mosses) writes:
>In article <1992Nov11.195443.23006@cis.ohio-state.edu>, ogden@seal (William F Ogden) writes:
>>Now algebraic semantics would seem to be predicated on the dubious
>>proposition that computation is entirely describable within a limited
>>first-order subarea of mathematics -- namely algebra.

I assume you mean "univeral algebra", and not "algebra" as mathematicians
generally use the word. 

>- which can specify Turing machine computations, and hence is
>universal.  In any case, there are `first-order' models for domains,
>e.g., Scott's P-omega model, where continuous functions are
>represented by their approximation graphs.

In any event, I've never been able to understand the virtue of working 
within a mathematical model of computation which permits description of
processes that cannot be carried out, even in principle, by any physical
computing device. What is it that one intends to learn by application of
these methods?


>
>-- 
>Peter D. Mosses | Computer Science Department | <pdmosses@daimi.aau.dk> 
>~~~~~~~~~~~~~~~ | Aarhus University           | Phone: +45 86 12 71 88 
>                | Ny Munkegade, Building 540  | Fax:   +45 86 13 57 25 
>                | DK-8000 Aarhus C,  Denmark  | Telex: 64767 aausci dk


-- 


yodaiken@chelm.cs.umass.edu