dc.contributor.author |
Calude, CS |
en |
dc.contributor.author |
Coull, A |
en |
dc.contributor.author |
Lewis, JP |
en |
dc.date.accessioned |
2015-01-05T00:14:06Z |
en |
dc.date.available |
2015-01-05T00:14:06Z |
en |
dc.date.issued |
2014 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-471 (2014) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/23903 |
en |
dc.description.abstract |
A list of the most important unsolved problems in VFX production
should include the word “pipeline”. Pipelines are a major source of
efficiency, but they require ongoing development, and are seemingly
never finished. They also resist change. Is it possible to
automatically generate pipelines given desired inputs and outputs
or design one “universal” pipeline that can do everything with no
further modification ever needed? We present similarities between
pipelines and programs, and recall metamathematical statements
which show that the answer to the above question is negative. However,
new approximate solutions may mitigate to a large extent this
negative situation. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php |
en |
dc.title |
Can We Solve the Pipeline Problem? |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |