Computability and data types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computability and data types

Full text

Pdf (497 KB)

Source

Technical Symposium on Computer Science Education archive
Proceedings of the twenty-first SIGCSE technical symposium on Computer science education table of contents

Washington, D.C., United States

Pages: 219 - 223

Year of Publication: 1990

ISBN:0-89791-346-9

Also published in ...

Author

Newcomb Greenleaf

Department of Computer Science, Columbia University, New York, N.Y.

Sponsor

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 15, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/323410.323457 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	George S. Boolos , Richard C. Jeffrey, Computability and logic: 3rd ed., Cambridge University Press, New York, NY, 1989
	2	A. H. Brady, The busy beaver game and the meaning of life, A half-century survey on The Universal Turing Machine, p.259-277, October 1988, Berlin, Germany
	3	Clarke, M. R. B. and D. M Gabbay. An inmitionistic basis for non-monotonic reasoning. In Non-Standard Losicsfor Automated Reasoning, Smets, P. et. al, Ed., Acadeznic Pw.~, 1988.
	4	R. L. Constable , S. F. Allen , H. M. Bromley , W. R. Cleaveland , J. F. Cremer , R. W. Harper , D. J. Howe , T. B. Knoblock , N. P. Mendler , P. Panangaden , J. T. Sasaki , S. F. Smith, Implementing mathematics with the Nuprl proof development system, Prentice-Hall, Inc., Upper Saddle River, NJ, 1986
	5	Dewd~y, A. K. "Computer Recreations". Scientific American 252 (April, 1984), 20-30. Reprinted in The Armchair Universe, Freeman, 1988, 160-171..
	6	Greenleaf, N. Liberal constructive set flw, ory. In Constructive Mathemau'cs, Richman, F., Ed., Springer Lecture Notes in Mathematics, Vol. 873, 1981.
	7	Marvin Lee Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, Inc., Upper Saddle River, NJ, 1967
	8	Rado, T. "On non-computable functions". Bell Sys. Tech. Journal (1962), 887-884.
	9	Troelstra, A.S. "Intuitionistic extensions of the reals". Nieuw Arch. Wisk. 28 (1980), 63-113.