Proving and Programming

Calude, C.S; Calude, E; Marcus, S

dc.contributor.author	Calude, C.S	en
dc.contributor.author	Calude, E	en
dc.contributor.author	Marcus, S	en
dc.date.accessioned	2009-04-16T23:13:14Z	en
dc.date.available	2009-04-16T23:13:14Z	en
dc.date.issued	2007-06	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-309 (2007)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3816	en
dc.description.abstract	There is a strong analogy between proving theorems in mathematics and writing programs in computer science. This paper is devoted to an analysis, from the perspective of this analogy, of proof in mathematics. We will argue that while the Hilbertian notion of proof has few chances to change, future proofs will be of various types, will play different roles, and their truth will be checked differently. Programming gives mathematics a new form of understanding. The computer is the driving force behind these changes.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Proving and Programming	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en