On Goedel speed-up and succinctness of language representations
type: Item
instance of: scholarly article
title: On Goedel speed-up and succinctness of language representations
zbMATH Open document ID: 0526.68034
DOI: 10.1016/0304-3975(83)90016-6
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03F99
zbMATH DE Number: 3835344
zbMATH Keywords: relative succinctness between different representations of languages
zbMATH Keywords: non-recursive shortening of proofs
author: J. Hartmanis
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90016-6
OpenAlex ID: W2008388355
cites work: Q5588674
cites work: On the size of machines
cites work: Q3875311
cites work: Q4182501
cites work: On the Succinctness of Different Representations of Languages
cites work: Q4197341
cites work: Program size in restricted programming languages
cites work: Q5559220
cites work: Succinctness of Descriptions of Unambiguous Context-Free Languages
cites work: A note on the succinctness of descriptions of deterministic languages
description: scientific article; zbMATH DE number 3835344