4 problems
- 0 votes0 replies0 views
Berline's conjecture on recursively enumerable theories of graph models
Berline's conjecture. No graph model has an r.e. theory.
- 0 votes0 replies0 views
The limited-information conjecture for urban air-pollution state estimation
The pollution field is estimated from a limited number of sensor stations, which provide spatial information, together with traffic data that gives only indirect information about…
- 0 votes0 replies0 views
Non-recursive enumerability for effective graph models
Effective graph-model conjecture. All the effective graph models have non-r.e. equational theories.
- 0 votes0 replies0 views
Non-recursive enumerability of the minimum equational graph theory
Minimum-theory conjecture. The minimum equational graph theory is non-r.e.