article

Free access

On teaching theoretical foundations of Computer Science

Author:

Dino MandrioliAuthors Info & Claims

ACM SIGACT News, Volume 14, Issue 4

Pages 58 - 69

https://doi.org/10.1145/1008902.1008904

Published: 01 September 1982 Publication History

Abstract

Theoretical foundations of Computer Science (Automata Theory, Complexity, Formal Languages . . .) are taught almost everywhere within Computer Science curricula. However little effort is usually done to present this material in an integrated and motivated way, that is in such a way that its application and use in the solution of practical problems appears to any student.A proposal is developed in order to overcome this inadequacy and to emphasize the basic aspects of theoretical Computer Science.

References

[1]

/AA/ Alagic s., Arbib M. "The Design of well-structured and correct Programs", Springer-Verlag, 1978.

Digital Library

[2]

/ADA/ Ichbiah ed Al. "Preliminary ADA reference Manual" and "ADA: Rational for the Design", Sig Plan Notices, June 1979.

Digital Library

[3]

/AHU/ Aho A., Hopcroft J., Ullman J. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

Digital Library

[4]

/Ar1/ Arbib M. Theories of Abstract Automata, Prentice-Hall, 1969.

Digital Library

[5]

/Ar2/ Arbib M. (ed.) Machines, Languages and Semigroups, Accademic Press, 1968.

[6]

/Au/ Ausiello G. Complessità di Calcolo delle Funzioni, Boringhieri, 1975.

[7]

/CHI/ CCITT W.G. XI/3 "A Proposal for the Definition of the CCITT high-level language (CHILL)" The Braun Document, Geneve, April 1980.

[8]

/Cur/ Austing et al. (ed.) Curriculum 78, CACM, March 1979.

[9]

/Fa/ Fairley R. Letter on /RS/ - ACM Forum, CACM, June 1980.

[10]

/Gg/ Goguen J., Lecture Notes of a Course on Algebraic Specification of Abstract Data Types, UCLA, 1976.

[11]

/GH/ Goodman S., Hedetuiemi S. "Introduction to the Design and Analysis of Algorithms, Mc Graw-Hill, 1977.

Digital Library

[12]

/Gr/ Greibach S. Theory of Program Structures: Schemes, Semantics, Verification, Springer Verlag, 1975.

Digital Library

[13]

/Gor/ Gordon M. The Denotational Description of Programming Languages, Springer Verlag, 1979.

Digital Library

[14]

/HoU1/ Hopcroft J., Ullman J. "Formal languages and their relations to automata", Addison Wesley, 1968.

Digital Library

[15]

/HoU2/ Hopcroft J., Ullman J. Introduction to Automata Theory Languages and Computation, Addison Wesley, 1979.

Digital Library

[16]

/JT/ Jensen R., Tonies C. (ed.) Software Engineering, Prentice Hall, 1979.

[17]

/KFA/ Kalman F., Falb P., Arbib M. "Topics in mathematical Systems Theory", Mc Graw-Hill, 1969.

[18]

/Kn/ Knuth D. The Art of Computer Programming, Addison Wesley, 1973.

Digital Library

[19]

/Ma/ Manna Z. The Mathematical Theory of Computation, Mc Graw-Hill, 1973.

Digital Library

[20]

/MC/ Mead, Conway "Introduction to VLSI Systems", Addison Wesley, 1980.

Digital Library

[21]

/Mi/ Minsky M. Computation, finite and infinite Machines, Prentice Hall, 1967.

Digital Library

[22]

/MY/ Machtey M., Young P. "An Introduction to the General Theory of Algorithms", North Holland, 1978.

Digital Library

[23]

/Pet/ Peterson J. "Petri Nets" ACM Comp. Surveys, Dec. 1977.

Digital Library

[24]

/RS/ Ralston A., Shaw M. "Curriculum 78 - Is Computer Science really that unmathematical?", CACM, Feb. 1980.

Digital Library

[25]

/RS'/ ACM Forum, CACM June 1980: Author's Response to letters on /RS/

[26]

/Ru/ Russel A. Letter on /RS/ - ACM Forum CACM, June 1980.

[27]

/Sa/ Savage J. "The complexity of Computing", John Wiley & Sons, 1976.

Digital Library

[28]

/Sc/ Scott D. "Outline of a mathematical Theory of Computation", 4th Annual Princeton Conf. on Inf. Sci., 1970.

[29]

/SM/ Stanat P., McAllister D. "Discrete Mathematics in Comp. Sc." Prentice-Hall, 1977.

Digital Library

[30]

/SWP/ Schneider G., Weingart S., Perlman D. "An Introduction to Programming and Problem Solving with Pascal", John Wiley and Sons, 1978.

Digital Library

[31]

/We/ Wegner P. "The Vienna definition language" Comp. Surveys ACM, vol. 4 N. 1, 1972.

Digital Library

[32]

/Wi1/ Wirth N. "Systematic Programming: an Introduction" Prentice-Hall, 1975.

Digital Library

[33]

/Wi2/ Wirth N. "Algorithms + Data Structures = Programs", Prentice Hall, 1975.

Digital Library

Cited By

MacCormick JBarnes TGarcia DHawthorne EPérez-Quiñones M(2018)Strategies for Basing the CS Theory Course on Non-decision ProblemsProceedings of the 49th ACM Technical Symposium on Computer Science Education10.1145/3159450.3159557(521-526)Online publication date: 21-Feb-2018
https://dl.acm.org/doi/10.1145/3159450.3159557
Crescenzi PEnström EKann VCarter JUtting IClear A(2013)From theory to practiceProceedings of the 18th ACM conference on Innovation and technology in computer science education10.1145/2462476.2465582(16-21)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1145/2462476.2465582
Surma D(2012)Rolling the dice on theoryJournal of Computing Sciences in Colleges10.5555/2379703.237971628:1(74-80)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.5555/2379703.2379716

On teaching theoretical foundations of Computer Science
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
2. Theory of computation

Recommendations

On teaching theoretical foundations of computer science

Theoretical foundations of Computer Science (Automata Theory, Complexity, Formal Languages...) are taught almost everywhere within Computer Science curricula. However little effort is usually done to present this material in an integrated and motivated ...
Computer Science Teaching Knowledge: A Framework and Assessment (Abstract Only)
SIGCSE '17: Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education

Educators, researchers, politicians, tech companies, and others continue to advocate for the importance of K-12 students learning computer science in our increasingly tech-driven society. One way school districts in the United States address this ...
Training computer science teaching assistants: a seminar for new TAs

We describe a one-quarter seminar required of first-time teaching assistants in computer science. The seminar acclimates TAs to teaching undergraduates in the university, to departmental policies and to special problems and issues in teaching computer ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News

ACM SIGACT News Volume 14, Issue 4

Fall-Winter 1982

46 pages

ISSN:0163-5700

DOI:10.1145/1008902

Issue’s Table of Contents

Copyright © 1982 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1982

Published in SIGACT Volume 14, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
308
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)5

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

MacCormick JBarnes TGarcia DHawthorne EPérez-Quiñones M(2018)Strategies for Basing the CS Theory Course on Non-decision ProblemsProceedings of the 49th ACM Technical Symposium on Computer Science Education10.1145/3159450.3159557(521-526)Online publication date: 21-Feb-2018
https://dl.acm.org/doi/10.1145/3159450.3159557
Crescenzi PEnström EKann VCarter JUtting IClear A(2013)From theory to practiceProceedings of the 18th ACM conference on Innovation and technology in computer science education10.1145/2462476.2465582(16-21)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1145/2462476.2465582
Surma D(2012)Rolling the dice on theoryJournal of Computing Sciences in Colleges10.5555/2379703.237971628:1(74-80)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.5555/2379703.2379716

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents