# Undecidable problem

## Papers overview

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

Highly Cited

2005

Highly Cited

2005

- 2005

This paper is related to the work of Hao Wang and others growing out of a problem which he proposed in [8], w 4.1. Suppose thatâ€¦Â (More)

Is this relevant?

2003

2003

- Theor. Comput. Sci.
- 2003

In this paper we give a new undecidability result about tiling problems. Given a -nite set of polyomino types, the problemâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- LATIN
- 2000

Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at nyâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- ACM Trans. Program. Lang. Syst.
- 2000

Static program analysis is concerned with the computation of approximations of the runtime behavior of programs. Preciseâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- 2000

We show that the boundedness of the set of all products of a given pair Î£ of rational matrices is undecidable. Furthermore, weâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- AAAI/IAAI
- 1999

We investigate the computability of problems in probabilistic planning and partially observable infinite-horizon Markov decisionâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- ICALP
- 1994

We consider the veriication of a particular class of innnite-state systems, namely systems consisting of nite-state processesâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- J. Log. Program.
- 1993

D Datalog is a powerful query language for relational databases [lo]. We consider the problems of determining containmentâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- POPL
- 1992

Fâ‰¤ is a typed Î»-calculus with subtyping and bounded second-order polymorphism. First proposed by Cardelli and Wegner, it has beenâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- LOPLAS
- 1992

Static analysis of programs is indispensable to any software tool, environment, or system that requires compile-time informationâ€¦Â (More)

Is this relevant?