Normal Functions As A New Way Of Defining Computable Functions

Normal Functions As A New Way Of Defining Computable Functions

Show other versions (1)

Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way. Discovery of Ackermann function proved that not all functions that can be easily computed can be so easily described with Hilbe...

Full description

Bibliographic Details
Main Author: Leszek Dubiel
Format: Article
Language:English
Published: AGH University of Science and Technology Press 2004-01-01
Series:Computer Science
Subjects:
The Turing Machine; recursive functions; normal functions
Online Access:http://journals.agh.edu.pl/csci/article/download/493/374
id doaj-60978be3f6514d76ad55b9a165a6c676
record_format Article
spelling doaj-60978be3f6514d76ad55b9a165a6c6762020-11-24T20:54:26ZengAGH University of Science and Technology PressComputer Science1508-28062004-01-016710.7494/csci.2004.6.5.7Normal Functions As A New Way Of Defining Computable FunctionsLeszek Dubiel0Akademia Górniczo-Hutnicza w KrakowieReport sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way. Discovery of Ackermann function proved that not all functions that can be easily computed can be so easily described with Hilbert’s system of recursive functions. Normal functions lack this disadvantage.http://journals.agh.edu.pl/csci/article/download/493/374The Turing Machine; recursive functions; normal functions
collection DOAJ
language English
format Article
sources DOAJ
author Leszek Dubiel
spellingShingle Leszek Dubiel
Normal Functions As A New Way Of Defining Computable Functions
Computer Science
The Turing Machine; recursive functions; normal functions
author_facet Leszek Dubiel
author_sort Leszek Dubiel
title Normal Functions As A New Way Of Defining Computable Functions
title_short Normal Functions As A New Way Of Defining Computable Functions
title_full Normal Functions As A New Way Of Defining Computable Functions
title_fullStr Normal Functions As A New Way Of Defining Computable Functions
title_full_unstemmed Normal Functions As A New Way Of Defining Computable Functions
title_sort normal functions as a new way of defining computable functions
publisher AGH University of Science and Technology Press
series Computer Science
issn 1508-2806
publishDate 2004-01-01
description Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way. Discovery of Ackermann function proved that not all functions that can be easily computed can be so easily described with Hilbert’s system of recursive functions. Normal functions lack this disadvantage.
topic The Turing Machine; recursive functions; normal functions
url http://journals.agh.edu.pl/csci/article/download/493/374
work_keys_str_mv AT leszekdubiel normalfunctionsasanewwayofdefiningcomputablefunctions
_version_ 1716794500338155520

Similar Items