Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Berechenbarkeit und Komplexität > Aufzählbarkeit & (Semi-)Entscheidbarkeit > Flashcards

Aufzählbarkeit & (Semi-)Entscheidbarkeit Flashcards

1
Q

(rekursiv) aufzählbar - Definition

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Entscheidebarkeit - Theorem

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Aufzählbare Sprachen - Theorem

A

Eine Sprache L ist aufzählbar gdw. L ist semi-entscheidbar.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

semi-entscheibar - Äquivalenzen

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

entscheidbar - Äquivalenzen

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly

Berechenbarkeit und Komplexität (15 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions