Treffer: The euclid abstract machine : Trisection of the angle and the halting problem

Title:
The euclid abstract machine : Trisection of the angle and the halting problem
Authors:
MYCKA, Jerzy, COELHO, Francisco, COSTA, José Félix
Source:
Unconventional computation (5th international conference, UC 2006, York, UK, September 4-8, 2006)0UC 2006. :195-206
Publisher Information:
Berlin; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 4 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Fonction récursive, Recursive function, Función recursiva, Géométrie euclidienne, Euclidean geometry, Geometría euclidiana, Machine Turing, Turing machine, Máquina Turing, Machine abstraite, Abstract machine, Máquina abstracta, Méthode calcul, Computing method, Método cálculo, Non existence, No existencia, Sémantique, Semantics, Semántica
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of Mathematics, University of Maria Curie-Sklodowska, Lublin, Poland
Department of Mathematics, Universidade de Évora, Portugal
Department of Mathematics, I.S.T., Universidade Técnica de Lisboa and CMAF -Centro de Matemática e Aplicações Fundamentais, Lisboa, Portugal
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19130939
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19130939
Database:
PASCAL Archive

Weitere Informationen

What is the meaning of hypercomputation, the meaning of computing more than the Turing machine? Concrete non-computable functions always hide the halting problem as far as we know. Even the construction of a function that grows faster than any recursive function the Busy Beaver - a more natural function, hides the halting function, that can easily be put in relation with the Busy Beaver. Is this super-Turing computation concept related only with the halting problem and its derivatives? We built an abstract machine based on the historic concept of compass and ruler construction 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 purpose, the goal, and the meaning of computing beyond Turing.