| 000 -LEADER |
|---|
| fixed length control field |
02225nam a22002177a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CITU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20211004120034.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
211004b ||||| |||| 00| 0 eng d |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.352 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Preferred name for the person |
Reales, Roel B. |
| Relator term |
author |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
The unlimited register machine programmer / |
| Statement of responsibility, etc |
Roel B. Reales. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
16 leaves : |
| Dimensions |
33 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Source |
rdacontent |
| Content type term |
text |
| Content type code |
txt |
| 337 ## - MEDIA TYPE |
|---|
| Source |
rdamedia |
| Media type term |
unmediated |
| Media type code |
n |
| 338 ## - CARRIER TYPE |
|---|
| Source |
rdacarrier |
| Carrier type term |
volume |
| Carrier type code |
nc |
| 502 ## - DISSERTATION NOTE |
|---|
| Dissertation note |
Special Project (Master in Computer Science) -- Cebu Institute of Technology - University, February 2008. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
Mathematical theorems, as well as the notions of computing are being applied in different field of studies. The world of computing, however complicated, is governed by sets of procedures in order to achieve an output from a set of inputs. This illustrates the mechanical nature that is being captured and realized into calculating machines, more popularly known as the ?Modern Digital computers? today. Despite the astonishing calculating power of such machines, they are bounded by limitations. For instance, they cannot compute all the problems.<br/><br/>Some computing problems are found to be non-computable. This means that there exist no set of procedures that will compose an algorithm to solve such problems. Whether a problem is computable or not, the real problem here is providing either of the statement. One way to prove that a problem is computable is through programming on a hypothetical machine called the ?Unlimited Register Machine? (or URM). A problem is said to be computable if there exists a URM program that computes it. Some theorems had been established on URM computing, making it possible to compute for complex mathematical functions on natural numbers using only four primitive machine instructions. It is to this extent that this work is aimed ? to illustrate the definitions, theorems and proofs through software that generates URM programs from simple to complex, non-recursive to recursive mathematical functions, as well as illustrate how the URM works by executing those programs. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computable functions. |
| Source of heading or term |
|
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Functional programming languages. |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
THESIS / DISSERTATION |