On splitting recursive sets
type: Item
instance of: scholarly article
title: On splitting recursive sets
zbMATH Open document ID: 0392.03028
DOI: 10.1016/0022-0000(78)90034-X
author: Seth Breidbart
published in: Journal of Computer and System Sciences
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 3608009
zbMATH Keywords: Splitting Recursive Sets
zbMATH Keywords: Context-Free Set
zbMATH Keywords: Formal Language
zbMATH Keywords: Regular Set
zbMATH Keywords: Computational Complexity
zbMATH Keywords: Blum Measures
zbMATH Keywords: Deterministic Turing Machine
zbMATH Keywords: Recursively Enumerable Sets
MaRDI profile type: Publication
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Q4138187
cites work: Q5576254
cites work: On the Computational Complexity of Algorithms
cites work: On the Structure of Polynomial Time Reducibility
cites work: Splitting a context-sensitive set
cites work: Q5573961
full work available at URL: 0022-0000(78)90034-x
OpenAlex ID: W2078845413
description: scientific article; zbMATH DE number 3608009