Please use this identifier to cite or link to this item:

Title: The euclid abstract machine: Trisection of the angle and the halting problem
Authors: Coelho, Francisco
Costa, José Félix
Mycka, Jerzy
Keywords: undecidable problems
Issue Date: 2006
Publisher: Springer Berlin/Heidelberg
Abstract: Concrete non-computable functions are usually re- lated to the halting function. Is it possible to present examples of non-computability, which are unrelated to the halting prob- lem and its derivatives? We built an abstract machine based on the historic concept of compass and ruler constructions (a com- pass construction would suffice) which reveals the existence of non-computable functions not related with the halting problem. These natural, and the same time, non-computable functions can help to understand the nature of the uncomputable and the pur- pose, the goal, and the meaning of computing beyond Turing.
Type: article
Appears in Collections:INF - Artigos em Livros de Actas/Proceedings

Files in This Item:

File Description SizeFormat
euclidijuc.pdf253.84 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois