Kanda, Akira and Park, David (1979) When are two effectively given domains identical? University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Kanda_cs-rr-029.pdf - Published Version Download (1075Kb) | Preview

Request Changes to record.

Abstract

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:	Report
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Computable functions, Partially ordered sets
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	April 1979
Dates:	Date Event April 1979 ["eprint_fieldopt_dates_date_type_available" not defined]
Date of first compliant deposit:	1 August 2016
Number:	Number 29
Number of Pages:	18
DOI:	CS-RR-029
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Access rights to Published version:	Open Access
Funder:	Science Research Council (Great Britain) (SRC)
Grant number:	GR/A66 772 (SRC)

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads