Machine-independent description of certain machine complexity classes
type: Item
instance of: scholarly article
title: Machine-independent description of certain machine complexity classes
zbMATH Open document ID: 0493.03014
DOI: 10.1007/BF01629446
author: S. V. Pakhomov
published in: Journal of Soviet Mathematics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D60
zbMATH DE Number: 3775503
zbMATH Keywords: classes of functions computable by Turing machines within bounded space and time
zbMATH Keywords: machine complexity classes
MaRDI profile type: Publication
cites work: Classes of Predictably Computable Functions
cites work: Q5586401
cites work: Subrecursiveness: Machine-independent notions of computability in restricted time and storage
cites work: A recursive and a grammatical characterization of the exponential-time languages
full work available at URL: https://doi.org/10.1007/bf01629446
OpenAlex ID: W2015596941
description: scientific article; zbMATH DE number 3775503