Subjects
(version: 964)
Course, academic year 2024/2025
Login :
Password :
Login via CAS
Study Information System
The page is loading...
Application
Subjects
--:--
Admission
Exam dates
Final Exams
x
Subjects
Thesis (Selection of subject)
Inquiry
Schedule NG
Study application - exchange students
Committees
Invitations for state exams and defences
Central catalogue
E-resources Portal
Discovery system
Moodle (E-learning)
UK Forum
UK Point
Centrum Carolina
Doctoral Study Hub
Klub Alumni
4EU+ European University Alliance
List of advisors
File manager
Graduation
Harmonogram
Life-Long Education programs
Notice-board
Who is Who
Login searching
Search ...
Teachers
Departments
Classes
Classification
View by plans
Setup
Details
Your browser does not support JavaScript, or its support is disabled. Some features may not be available.
Turing Machines - NLTM020
Title:
Turingovy stroje
Guaranteed by:
Department of Numerical Mathematics (32-KNM)
Faculty:
Faculty of Mathematics and Physics
Actual:
unlimited
Semester:
winter
E-Credits:
3
Hours per week, examination:
winter s.:2/0, Ex
[HT]
Capacity:
unlimited
Min. number of students:
unlimited
4EU+:
no
Virtual mobility / capacity:
no
State of the course:
cancelled
Language:
Czech
Teaching methods:
full-time
Class:
Výpočetní matematika
Incompatibility :
NTIN014
,
NUIN007
Interchangeability :
NLTM021
Opinion survey results
Examination dates
Schedule
Noticeboard
Annotation
- Czech
Algoritmicky vyčíslitelné funkce, jejich vlastnosti, ekvivalence jejich různých matematických definic. Rekursivní a rekursivně spočetné množiny. Časová a paměťová složitost algoritmů a problémů, NP - úplnost.
Last update: ()
contacts
Charles University
|
Information system of Charles University
| http://www.cuni.cz/UKEN-329.html