Results 21 to 30 of about 1,576,475 (325)
History and contributions of theoretical computer science [PDF]
Abstract We briefly review some of the major accomplishments of theoretical computer science. Results from theoretical computer science have had enormous impact on the development of programming languages and other areas of computer science. The impact of research in theoretical computer science is now being felt in the areas of cryptography ...
John E. Savage+2 more
openalex +3 more sources
Book Front Matter of LNCS ...
Diaz, Josep+2 more
openaire +3 more sources
Theoretical Computer Science in Italy
Alessandra Cherubini+2 more
openalex +3 more sources
A Theoretical Computer Science Perspective on Consciousness and Artificial General Intelligence
Lenore Blum, Manuel Blum
doaj +2 more sources
Solomon Marcus Contributions to Theoretical Computer Science and Applications
Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised ...
Cristian S. Calude, Gheorghe Păun
doaj +1 more source
Automata in SageMath---Combinatorics meet Theoretical Computer Science [PDF]
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved ...
Clemens Heuberger+2 more
doaj +1 more source
Theoretical Aspects of Computer Science [PDF]
International ...
Marion, Jean-Yves, Schwentick, Thomas
openaire +4 more sources
Combining data and theory for derivable scientific discovery with AI-Descartes
Scientists aim to discover meaningful formulae that accurately describe experimental data. Mathematical models of natural phenomena can be manually created from domain knowledge and fitted to data, or, in contrast, created automatically from large ...
Cristina Cornelio+8 more
doaj +1 more source
Balanced Avoidance Games on Random Graphs [PDF]
We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with $n$ vertices are revealed two at a time in a random order.
Martin Marciniszyn+2 more
doaj +1 more source
Gacs-Kucera Theorem, tightened by Barmpalias and Lewis-Pye, w.t.t.-reduces each infinite sequence to a Kolmogorov--Martin-Lof random one and is broadly used in various Math and CS areas. Its early proofs are somewhat cumbersome, but using some general concepts yields significant simplification illustrated here.
arxiv +1 more source