When are two effectively given domains identical?
Kanda, A. and Park, D.M.R. (1979) When are two effectively given domains identical? Technical Report. Department of Computer Science, Coventry, UK.
Download (980Kb) | Preview
In this paper, we will observe that the notion of computability in an effectively given domain is dependent on the indexing of its basis. This indicates that we cannot identify two effectively given domains just because they are order isomorphic. We propose a suitable notion of effective isomorphism to compensate for this deficiency. Also we show that for every recursive domain equation, there is an effectively given domain which is an initial solution to within effective isomorphism.
|Item Type:||Monograph (Technical Report)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||27 Apr 2012 08:59|
|Last Modified:||01 Nov 2012 18:07|
Actions (login required)