Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.Any queries about submissions and peer review should be addressed to the TCS editorial office: tcs@elsevier.com.Papers published in Theoretical Computer Science are grouped in three sections according to their nature. The first section `Algorithms, automata, complexity and games' is devoted to the study of algorithms and their complexity using analytical, combinatorial or probabilistic methods. It includes the whole field of abstract complexity (i.e. all the results about the hierarchies that can be defined using Turing machines), the whole field of automata and language theory (including automata on infinite words and infinitary languages), the whole field of geometrical (graphic) applications and the whole field of measurement of system performance using statistical methods.The second section,`Logic, semantics and theory of programming', is devoted to formal methods to check properties of programs or implement formally described languages; it contains all papers dealing with semantics of sequential and parallel programming languages. All formal methods treating these problems are published in this section, including rewriting techniques, abstract data types, automatic theorem proving, calculi such as SCP or CCS, Petri nets, new logic calculi and developments in categorical methods.The third section, 'Natural Computing', is devoted to the study of computing occurring in nature and computing inspired by nature. In the rapidly evolving field of computer science, natural computing plays an important role as the catalyst for the synergy of human designed computing with the computing going on in nature. This synergy leads to a deeper and broader understanding of the nature of computation. Although natural computing is concerned also with experiments and applications, this section of Theoretical Computer Science is focused on the theoretical aspects of natural computing with clear relevance to computing. Among others, it will contain papers dealing with the theoretical issues in evolutionary computing, neural networks, molecular computing, and quantum computing.

理論計算機科學在精神上是數學的、抽象的，但它是從實踐和日常計算中獲得動力的。其目的是了解計算的性質，并因此提供更有效的方法。所有介紹或研究數學、邏輯和形式概念和方法的論文都是受歡迎的，前提是它們的動機明顯來自計算領域。有關提交和同行評審的任何疑問應發送至TCS編輯辦公室：tcs@elsevier.com。理論計算機科學發表的論文根據其性質分為三個部分。第一部分“算法、自動機、復雜性和游戲”主要研究使用分析、組合或概率方法的算法及其復雜性。它包括整個領域的抽象復雜的層次結構(即所有的結果可以定義使用圖靈機),整個自動機和語言理論(包括自動機在無限詞匯和infinitary語言),整個幾何(圖形)應用程序和整個測量系統性能使用統計方法。第二部分“邏輯、語義學和編程理論”專門介紹檢查程序屬性或實現正式描述語言的形式方法；它包含了所有涉及順序和并行編程語言語義學的論文。所有處理這些問題的形式化方法都發表在本節中，包括重寫技術、抽象數據類型、自動定理證明、計算（如scp或ccs）、Petri網、新邏輯計算和分類方法的發展。第三部分“自然計算”專門研究自然中發生的計算和受自然啟發的計算。在計算機科學快速發展的領域中，自然計算作為人類設計計算與自然計算協同作用的催化劑發揮著重要作用。這種協同作用使人們對計算的本質有了更深入、更廣泛的理解。雖然自然計算也與實驗和應用有關，但這一部分理論計算機科學的重點是自然計算的理論方面，與計算有著明顯的相關性。除此之外，它還將包含有關進化計算、神經網絡、分子計算和量子計算等理論問題的論文。