Results 51 to 60 of about 3,192,834 (175)
Algebraic recognizability of languages [PDF]
Mathematical Foundations of Computer Science 2004, Tch\`{e}que,
R\'{e}publique (2004) 149-175, 2006 Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related notion extends to more complex models, such as those developed for modeling distributed or timed behaviors.
arxiv
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata [PDF]
Computer Science Logic , 15th International Workshop, CSL 2001,
10th Annual Conference of the European Association for Computer Science
Logic, Paris, September 10-13, 2001., France (2001), 2010 The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hierarchy.
arxiv
Quantum Computation: A Computer Science Perspective [PDF]
arXiv, 2005 The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented in detail. Throughout there is an emphasis on the physical as well as the abstract aspects of computation and the ...
arxiv
Sensemaking and Success in the Transition from Community Colleges to University IS/CS/CE Programs [PDF]
, 2018 Increasing the enrollment of women, minority, and other underrepresented populations in undergraduate information systems and computing programs is an important social issue. We explore ways of attracting and retaining community college transfer students—
Bott, Gregory +6 more
core +1 more source
The prospects for mathematical logic in the twenty-first century [PDF]
Bulletin of Symbolic Logic 7 (2001) 169-196, 2002 The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
arxiv
Large value estimates in number theory, harmonic analysis, and computer science [PDF]
arXivWe survey large value problems, including the large value problem for Dirichlet polynomials, the restriction problem, and problems from computer science. We describe known techniques and open problems, drawing on perspectives from all three fields.
arxiv
Tree Automata Make Ordinal Theory Easy [PDF]
Foundations of Software Technology and Theoretical Computer
Science, 26th International Conference, 2006, Proceedings. FSTTCS 2006 (2006)
286-297, 2006 We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new representation of (sets of) ordinals by (infinite) trees.
arxiv
Crossing the divide: Putting information seeking research and theory into computer science practice to make information search systems and services more effective for the user [PDF]
, 2012 Carol C. Kuhlthau +5 more
openalex +1 more source
Artificiality in Social Sciences [PDF]
Rennard, J.-P., Artificiality in Social Sciences, in Rennard,
J.-P. (Ed.), Handbook of Research on Nature Inspired Computing for Economics
and Management, p.1-15, IGR, 2006, 2007 This text provides with an introduction to the modern approach of artificiality and simulation in social sciences. It presents the relationship between complexity and artificiality, before introducing the field of artificial societies which greatly benefited from the computer power fast increase, gifting social sciences with formalization and ...
arxiv
Fixed Point Theorems in Computability Theory [PDF]
arXivWe give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to these.
arxiv