Results 261 to 270 of about 656,567 (302)
Some of the next articles are maybe not open access.

Related searches:

Computer science teacher professional development and professional learning communities: a review of the research literature

Computer Science Education, 2021
Background & Context Many efforts have been dedicated to building computer science (CS) teacher capacity through offering professional development (PD) programs. Previous reviews indicated the need to offer more continual support for teachers.
Lijun Ni   +2 more
semanticscholar   +1 more source

Theoretical Computer Science: Computational Complexity

2020
How much time, space and/or hardware resource does require an algorithm? Such questions lead to surprising results: conceptual simplicity does not always go along with efficiency. A lot of quite natural questions remain open, e.g., the famous P \(=\) NP problem raised in 1970.
Bournez, Olivier   +6 more
openaire   +6 more sources

Seeking the Treasures of Theoretical Computer Science Education: Towards Educational Virtual Reality for the Visualization of Finite State Machines

International Conference on Teaching, Assessment, and Learning for Engineering, 2018
As metaphorical representations showed beneficial effects on several parts of computer science, this paper focuses on the question: How can metaphorical representations in VR enhance the understanding of theoretical computer science concepts?
A. Dengel
semanticscholar   +1 more source

Universal Algebra and Applications in Theoretical Computer Science

, 2018
From the Publisher: This graduate-level textbook provides an introduction to the basic ideas and concepts of universal algebra and surveys of newer developments.
K. Denecke, S. Wismath
semanticscholar   +1 more source

Theoretical Computer Science

2008
This chapter provides a self-contained introduction to a collection of topics in computer science that focusses on the abstract, logical, and mathematical aspects of computing. First, mathematical structures called graphs are described that are used to model pairwise relations between objects from a certain collection.
Israel Martínez-Pérez   +2 more
  +7 more sources

Computability, complexity, and languages - fundamentals of theoretical computer science

Computer science and applied mathematics, 2014
Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems.
Martin D. Davis, E. Weyuker
semanticscholar   +1 more source

Theoretical Computer Science: Computability, Decidability and Logic

2020
This chapter deals with a question in the very core of IA: what can be computed by a machine? An agreement has been reached on the answer brought by Alan Turing in 1936. Indeed, all other proposed approaches have led to exactly the same answer. Thus, there is a mathematical model of what can be done by a machine.
Bournez, Olivier   +6 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy