The conference is concerned with the theory of comput ability and complexity over real-valued data. Scie ntists working in the area of computation on real- valued data come from different fields, such as th eoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, num erical mathematics and all branches of analysis. T he conference provides a unique opportunity for pe ople from such diverse areas to meet, present work in progress and exchange ideas and knowledge.
\nThe topics of interest include foundational work on various models and approaches for describ ing computability and complexity over the real num bers. They also include complexity-theoretic inves tigations, both foundational and with respect to c oncrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic asp ects of various computational questions from physi cs and from other fields involving computations ov er the real numbers.
\nInvited Speakers: T akako Nemoto (Sendai, Japan), Selwyn Ng (NTU, Sing apore), Yudai Suzuki (Oyama, Japan) and Patrick Uf tring (München, Germany).
\nA uthors are invited to submit 1-2 pages abstracts i n PDF format, including references via EasyChair. If full versions of papers are already available as techn ical report or arXiv version, then corresponding l inks should be added to the reference list. Final versions of abstracts might be distributed to part icipants in hardcopy and/or in electronic form.
\n