Hostname: page-component-77f85d65b8-jkvpf Total loading time: 0 Render date: 2026-03-27T20:21:13.299Z Has data issue: false hasContentIssue false

Defining data structures via Böhm-out1

Published online by Cambridge University Press:  07 November 2008

Enrico Tronci
Affiliation:
Dipartimento Matematica Pura ed Applicata, Università di L'Aquila,2Via Vetoio, Coppito, 67100 L'Aquila, Italy (e-mail: tronci@smaq20.univaq.it)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a Böhm-out problem.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 1995
Submit a response

Discussions

No Discussions have been published for this article.