Publication
Boundedness of the domain of definition is undecidable for polynomial odes
| dc.contributor.author | Graça, Daniel | |
| dc.contributor.author | Buescu, Jorge | |
| dc.contributor.author | Campagnolo, Manuel | |
| dc.date.accessioned | 2012-04-13T08:37:11Z | |
| dc.date.available | 2012-04-13T08:37:11Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | Consider the initial-value problem with computable parameters dx dt = p(t, x) x(t0) = x0, where p : Rn+1 ! Rn is a vector of polynomials and (t0, x0) 2 Rn+1. We show that the problem of determining whether the maximal interval of definition of this initial-value problem is bounded or not is in general undecidable. | por |
| dc.identifier.other | AUT: DGR01772; | |
| dc.identifier.uri | http://hdl.handle.net/10400.1/1016 | |
| dc.language.iso | eng | por |
| dc.relation.publisherversion | http://dx.doi.org/10.1016/j.entcs.2008.03.007 | por |
| dc.title | Boundedness of the domain of definition is undecidable for polynomial odes | por |
| dc.type | conference object | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 57 | por |
| oaire.citation.issue | 202 | por |
| oaire.citation.startPage | 49 | por |
| oaire.citation.title | Electronic Notes in Theoretical Computer Science | por |
| person.familyName | Graça | |
| person.givenName | Daniel | |
| person.identifier.ciencia-id | 2D11-56DE-3F11 | |
| person.identifier.orcid | 0000-0002-0330-833X | |
| person.identifier.rid | D-2335-2011 | |
| person.identifier.scopus-author-id | 8882791800 | |
| rcaap.rights | openAccess | por |
| rcaap.type | conferenceObject | por |
| relation.isAuthorOfPublication | ba0c1461-5d2d-4f06-b648-df4a1a505bdf | |
| relation.isAuthorOfPublication.latestForDiscovery | ba0c1461-5d2d-4f06-b648-df4a1a505bdf |