-
Notifications
You must be signed in to change notification settings - Fork 0
/
about.html
46 lines (44 loc) · 1.76 KB
/
about.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
<!DOCTYPE html>
<html manifest="urm-evaluator.appcache">
<head>
<title>About the URM evaluator</title>
<link href="ext/app-icon.png" rel="apple-touch-icon">
<link href="ext/style.css" rel="stylesheet" type="text/css">
</head>
<body>
<div id="about">
<h1>About the <a href="./">URM evaluator</a></h1>
<p>
An
<a href="http://planetmath.org/encyclopedia/UnlimitedRegisterMachine.html">
Unlimited Register Machine</a>
is a kind of very basic computer. (The ‘unlimited’
part refers to the number of registers that can be used; with
a simulator like this, there will be a limit imposed by the
computer it's running on). It only has four instructions,
described on the evaluator page. By convention, the inputs and
outputs start from the lowest-numbered register and work
upwards.
</p>
<p>
The Open University course
<a href="http://www3.open.ac.uk/study/undergraduate/course/MT381.htm">
M381 – Number theory and mathematical logic</a>
taught me about URMs (along with
<a href="https://en.wikipedia.org/wiki/G%C3%B6del%2C_Escher%2C_Bach">
Gödel, Escher, Bach</a>).
As with the
<a href="http://sean.mcgivern.me.uk/legendre-symbol-evaluator/">
Legendre symbol evaluator</a>,
I made this to help me understand the concept, and if
it’s useful to others, that’s a bonus. Source is
available on GitHub at
<a href="https://github.com/smcgivern/urm-evaluator">
smcgivern/urm-evaluator</a>.
</p>
</div>
<div id="byline">
<p>By <a href="http://sean.mcgivern.me.uk/">Sean McGivern</a></p>
</div>
</body>
</html>