Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms: Main Ideas and Applications > Interrelations between algorithms and calculuses
Algorithms: Main Ideas and Applications |
Vladimir Uspensky; A.L. Semenov
Springer Netherlands
Algorithms: Main Ideas and Applications
Interrelations between algorithms and calculuses
Authors

Vladimir Uspensky; Alexei Semenov

ARI Id

1664794866714_3251095

Access

Not Available Free

Pages

46-47

DOI

10.1007/978-94-015-8232-2_8

Chapter URL

https://rd.springer.com/chapter/10.1007/978-94-015-8232-2_8

Table of Contents of Book
Showing 1 to 20 of 34 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
i-xii
Introduction
Vladimir Uspensky; Alexei Semenov
1-2
Notation and Terminology
Vladimir Uspensky; Alexei Semenov
3-4
Front Matter
5-6
Preliminary notions of the theory of algorithms: constructive objects and aggregates; local properties and local actions
Vladimir Uspensky; Alexei Semenov
7-16
The general notion of an algorithm as an independent (separate) concept
Vladimir Uspensky; Alexei Semenov
17-21
Representative computational models
Vladimir Uspensky; Alexei Semenov
22-30
The general notion of a calculus as an independent (separate) concept
Vladimir Uspensky; Alexei Semenov
31-44
Representative generating models
Vladimir Uspensky; Alexei Semenov
45-45
Interrelations between algorithms and calculuses
Vladimir Uspensky; Alexei Semenov
46-47
Time and Space as complexities of computation and generation
Vladimir Uspensky; Alexei Semenov
48-57
Computable functions and generable sets; decidable sets; enumerable sets
Vladimir Uspensky; Alexei Semenov
58-65
The concept of a μ-recursive function
Vladimir Uspensky; Alexei Semenov
66-67
Possibility of an arithmetical and even Diophantine representation of any enumerable set of natural numbers
Vladimir Uspensky; Alexei Semenov
68-69
Construction of an undecidable generable set
Vladimir Uspensky; Alexei Semenov
70-72
Post’s reducibility problem
Vladimir Uspensky; Alexei Semenov
73-76
The concept of a relative algorithm, or an oracle algorithm
Vladimir Uspensky; Alexei Semenov
77-79
The concept of a computable operation
Vladimir Uspensky; Alexei Semenov
80-83
The concept of a program; programs as objects of computation and generation
Vladimir Uspensky; Alexei Semenov
84-97
The concept of a numbering and the theory of numberings
Vladimir Uspensky; Alexei Semenov
98-107
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 34 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings