| If CiE Did Not Exist, It Would Be Necessary to Invent It Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees The Fan Theorem and Uniform Continuity Continuous Semantics for Strong Normalization A Thread Algebra with Multi-level Strategic Interleaving Membrane Computing Current Results and Future Problems How to Compare the Power of Computational Models Recombinant DNA, Gene Splicing as Generative Devices of Formal Languages Quantum Computing Symbol Grounding in Connectionist and Adaptive Agent Models The Complexity of Inductive Definability A Logical Approach to Abstract Algebra Schnorr Dimension Abstract Geometrical Computation: Turing-Computing Ability and Undecidability Computability in Computational Geometry SHRAD: A Language for Sequential Real Number Computation Borel Ranks and Wadge Degrees of Context Free w-Languages Fewer Epistemological Challenges for Connectionism An Algebraic View on Exact Learning from Queries The Church-Turing Thesis: Breaking the Myth Robust Simulations of Turing Machines with Analytic Maps and Flows Infinitary Computability with Infinite Time Turing Machines Combinatorial Models of Gene Assembly Symmetric Enumeration Reducibility Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory Finite Trees as Ordinals On the Problems of Definability in the Enumeration Degrees Computing a Model of Set Theory …… Author Index |
内容加载中，请稍后...
商品评论（0条）