Calude, CSCeline, KFGao, ZJain, SStaiger, LStephan, F2022-01-142022-01-142021CDMTCS Research Reports CDMTCS-552 (2021)1178-3540https://hdl.handle.net/2292/58014In this paper we study various notions of bi-immunity over alphabets with b 2 elements and recursive transformations between sequences on different alphabets which preserve them. Furthermore, we extend the study from sequences bounded by a constant to sequences over the alphabet of all natural numbers, which may or may not be bounded by a recursive function, and relate them to the Turing degrees in which they can occur.Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of ResearchCopyright: The author(s)http://purl.org/eprint/accessRights/OpenAccess