this book constitutes the refereed proceedings of the 14th international symposium fundamentals of computation theory, fct 2003, held in malmö, sweden in august 2003. the 36 revised full papers presented together with an invited paper and the abstracts of 2 invited talks were carefully reviewed and selected from 73 submissions. the papers are organized in topical sections on approximibility, algorithms, networks and complexity, computational biology, computational geometry, computational models and complexity, structural complexity, formal languages, and logic.