Article

Introducing undecidability

Authors:

Judith Gal-Ezer,

Dvir Lanzberg,

Daphna ShahakAuthors Info & Claims

ITiCSE '04: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education

Page 276

https://doi.org/10.1145/1007996.1008114

Published: 28 June 2004 Publication History

Get Access

Abstract

In this paper we suggest introducing undecidability to students in relatively early stages of their studies, in a way we used succefully in recent semesters.

Index Terms

Introducing undecidability
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
        Computer science education

Recommendations

On the undecidability of the limit behavior of Cellular Automata

Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well-known result, due to Kari, says that all nontrivial properties of ...
From decidability to undecidability by considering regular sets of instances
Highlights
- There are problems in LOGSPACE for which intersection non-emptiness with a given regular language is undecidable.
Abstract
We are lifting classical combinatorial problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem P in a potentially infinite given regular set is equivalent to the ...
Introducing undecidability

In this paper we suggest introducing undecidability to students in relatively early stages of their studies, in a way we used succefully in recent semesters.

Comments

Information & Contributors

Information

Published In

ITiCSE '04: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education

June 2004

296 pages

ISBN:1581138369

DOI:10.1145/1007996

Conference Chair:
Roger Boyle
University of Leeds, UK
,
Program Chairs:
Martyn Clark
University of Leeds, UK
,
Amruth Kumar
Ramapo College of NJ

ACM SIGCSE Bulletin Volume 36, Issue 3
September 2004
280 pages
ISSN:0097-8418
DOI:10.1145/1026487
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ITiCSE04

Sponsor:

ITiCSE04: Innovation and Technology in Computer Science Education

June 28 - 30, 2004

Leeds, United Kingdom

Acceptance Rates

Overall Acceptance Rate 552 of 1,613 submissions, 34%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
162
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Dec 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

On the undecidability of the limit behavior of Cellular Automata

From decidability to undecidability by considering regular sets of instances

Introducing undecidability