Introducing undecidability

Judith Gal-Ezer, Dvir Lanzberg, Daphna Shahak

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The introduction of undecidability to students in relatively early stages of their studies is discussed. The past experience has shown that the traditional way of introducing undecidability to the students has some disadvantages when applied in class. It is also shown that there are infinitely more problems than algorithms, and there are even more problems than machines. After applying the described steps it is found that there is an infinite number of problems that can not be solved by a computer.

Original languageEnglish
Title of host publicationProceedings of the 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science
Pages276
Number of pages1
Volume36
Edition3
DOIs
StatePublished - Sep 2004
EventITiCSE 2004 - 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education - Leeds, United Kingdom
Duration: 28 Jul 200430 Jul 2004

Publication series

NameSIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)
PublisherAssociation for Computing Machinery (ACM)
ISSN (Print)0097-8418

Conference

ConferenceITiCSE 2004 - 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education
Country/TerritoryUnited Kingdom
CityLeeds
Period28/07/0430/07/04

Keywords

  • Pedagogy
  • Undecidability

Fingerprint

Dive into the research topics of 'Introducing undecidability'. Together they form a unique fingerprint.

Cite this