Computation and Automata 1985
DOI: 10.1017/cbo9781107325630.002
|View full text |Cite
|
Sign up to set email alerts
|

Foreword by G. Rozenberg

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
11
0

Year Published

1996
1996
2017
2017

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(13 citation statements)
references
References 0 publications
2
11
0
Order By: Relevance
“…From S = 5 on, only lower bounds are known. For example, Σ(8) > 10 44 (Rozenberg and Salomaa, 1994). The proof that Σ(S) is a noncomputable function goes by reductio ad absurdum.…”
Section: Undecidability the Halting Problemmentioning
confidence: 99%
“…From S = 5 on, only lower bounds are known. For example, Σ(8) > 10 44 (Rozenberg and Salomaa, 1994). The proof that Σ(S) is a noncomputable function goes by reductio ad absurdum.…”
Section: Undecidability the Halting Problemmentioning
confidence: 99%
“…A stronger minister would have stood up to Mr Blunkett, telling him earlier that his proposals were unacceptable. 40 David Blunkett set himself up as lightning rod for the government's restiveness at the judiciary and the broader effects of the Human Rights Act. He was happy to tell the BBC:…”
Section: The Woolf At the Doormentioning
confidence: 99%
“…We start with an example, discussed in [125], of a language having a very low program-size complexity, but a fairly high computational complexity. Let α i , i = 0, 1, .…”
Section: Trade-offsmentioning
confidence: 99%