In computability theory, Rice's theorem states that all non-trivial, semantic properties of programs are undecidable. A semantic property is oneâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Martin Delacourt
- ICALP
- 2011

Cellular automata are a parallel and synchronous computing model, made of infinitely many finite automata updating according toâ€¦Â (More)

Is this relevant?

2010

2010

- Pierre Guillon, GaÃ©tan Richard
- STACS
- 2010

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose stateâ€¦Â (More)

Is this relevant?

2008

2008

- Andrea Asperti
- POPL
- 2008

The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hidemore informationâ€¦Â (More)

Is this relevant?

2008

2008

- Igor Carboni Oliveira, Walter Alexandre Carnielli
- Logic Journal of the IGPL
- 2008

We propose here an extension of Riceâ€™s Theorem to first-order logic, proven by totally elementary means. If P is any propertyâ€¦Â (More)

Is this relevant?

2007

2007

- Julien Cervelle, Pierre Guillon
- MFCS
- 2007

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. Weâ€¦Â (More)

Is this relevant?

2001

2001

Riceâ€™s Theorem states that all nontrivial language properties of recursively enumerable sets are undecidable. Borchert andâ€¦Â (More)

Is this relevant?

2000

2000

- Lane A. Hemaspaandra, JÃ¶rg Rothe
- Theor. Comput. Sci.
- 2000

Riceâ€™s Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert andâ€¦Â (More)

Is this relevant?

1997

1997

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert andâ€¦Â (More)

Is this relevant?

1996

1996

- Bernd Borchert, Frank Stephan
- Electronic Colloquium on Computational Complexity
- 1996

Rice's Theorem says that every nontrivial semantic property of programs is undecidable. It this spirit we show the followingâ€¦Â (More)

Is this relevant?

1994

1994

- Jarkko Kari
- Theor. Comput. Sci.
- 1994

Kari, J., Riceâ€™s theorem for the limit sets of cellular automata, Theoretical Computer Science 127 (1994) 2299254. Riceâ€™s theoremâ€¦Â (More)

Is this relevant?