Machine Turing And NotN. Creignou
List of bibliographic references
Number of relevant bibliographic references: 8.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000285 | Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France] | A Logical Account of PSPACE |
| 000377 | Olivier Bournez [France] | How much can analog and hybrid systems be proved (super-)Turing |
| 000450 | Peter Bürgisser [Allemagne] ; Felipe Cucker [Hong Kong] ; Paulin Jacobé De Naurois [France] | The complexity of semilinear problems in succinct representation |
| 000499 | Olivier Bournez [France] ; Emmanuel Hainry [France] | Elementarily computable functions over the real numbers and R-sub-recursive functions |
| 000584 | L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne] | On the computational complexity of imperative programming languages |
| 000630 | Olivier Bournez [France] ; Emmanuel Hainry [France] | An analog characterization of elementarily computable functions over the real numbers |
| 000682 | Henry S. Baird [États-Unis] ; Allison L. Coates [États-Unis] ; Richard J. Fateman [États-Unis] | PessimalPrint: a reverse Turing test |
| 000962 | V. D. Blondel [Belgique] ; O. Bournez [France] ; P. Koiran [France] ; J. N. Tsitsiklis [États-Unis] | The stability of saturated linear dynamical systems is undecidable |
| This area was generated with Dilib version V0.6.33. |  |