中文簡(jiǎn)介

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

投稿網(wǎng)址：http://ees.elsevier.com/tcs/

英文簡(jiǎn)介

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.