Characterizing complexity classes by general recursive definitions in higher types
type: Item
instance of: scholarly article
title: Characterizing complexity classes by general recursive definitions in higher types
zbMATH Open document ID: 0773.68032
DOI: 10.1016/0890-5401(92)90062-K
author: Andreas Goerdt
published in: Information and Computation
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 165616
zbMATH Keywords: recursive definitions
zbMATH Keywords: infinite syntactic hierarchy
zbMATH Keywords: first-order functions
zbMATH Keywords: finite structures
MaRDI profile type: Publication
cites work: Q3804171
cites work: Q3203014
cites work: Q3758820
cites work: Q5686017
cites work: Q3862379
cites work: Necessary and sufficient conditions for the universality of programming formalisms
cites work: Q3902993
cites work: Q3785901
description: scientific article; zbMATH DE number 165616