Nagual and Tonal Maths: Numbers, Sets, and Processes. Lukas A. Saul Oxford, England May, 2015

Similar documents
Material from Recitation 1

MITOCW watch?v=4dj1oguwtem

Section 1.7 Sequences, Summations Cardinality of Infinite Sets

Source of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D.

Section 2.4 Sequences and Summations

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions

Cantor s Diagonal Argument for Different Levels of Infinity

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

Cardinality of Sets. Washington University Math Circle 10/30/2016

CS6160 Theory of Computation Problem Set 2 Department of Computer Science, University of Virginia

Cardinality of Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Cardinality of Sets Fall / 15

Limitations of Algorithmic Solvability In this Chapter we investigate the power of algorithms to solve problems Some can be solved algorithmically and

To illustrate what is intended the following are three write ups by students. Diagonalization

The Size of the Cantor Set

A Proof of Pythagorian s Theorem

p x i 1 i n x, y, z = 2 x 3 y 5 z

Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008

MITOCW watch?v=kz7jjltq9r4

Name: CS 341 Practice Final Exam. 1 a 20 b 20 c 20 d 20 e 20 f 20 g Total 207

Lambda Calculus and Computation

CS 5 Nightly Wrapup College Canceled

Infinity and Uncountability. Countable Countably infinite. Enumeration

CS103 Spring 2018 Mathematical Vocabulary

MITOCW watch?v=zm5mw5nkzjg

CS61A Lecture 38. Robert Huang UC Berkeley April 17, 2013

.Math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in .

A B. bijection. injection. Section 2.4: Countability. a b c d e g

Continuous functions and homeomorphisms

Slides for Faculty Oxford University Press All rights reserved.

CS 531: Notes II. January 31, 2014

Using Cantor s Diagonal Method to Show ζ(2) is Irrational

1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall

Introduction to Immersion, Embedding, and the Whitney Embedding Theorems

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)

Lecture 5: The Halting Problem. Michael Beeson

What if current foundations of mathematics are inconsistent? Vladimir Voevodsky September 25, 2010

Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005

Topology Homework 3. Section Section 3.3. Samuel Otten

A.1 Numbers, Sets and Arithmetic

9.5 Equivalence Relations

Saturday Morning Math Group Austin Math Circle Austin Area Problem Solving Challenge

Calculating Cardinalities

Comparing sizes of sets

EXERCISE Which of the following is irrational? (C) 7 (D) 81 (A) (B)

Chapter 3. Set Theory. 3.1 What is a Set?

The Real Numbers. All of the numbers that you are currently familiar with are part of the set of real numbers.

Using Cantor s Diagonal Method to Show ζ(2) is Irrational

Enumerations and Turing Machines

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Chapter 12. Computability Mechanizing Reasoning

Interpretations and Models. Chapter Axiomatic Systems and Incidence Geometry

Diagonalization. The cardinality of a finite set is easy to grasp: {1,3,4} = 3. But what about infinite sets?

Clustering: Centroid-Based Partitioning

2. Functions, sets, countability and uncountability. Let A, B be sets (often, in this module, subsets of R).

On the Structure and Sizes of Infinitely Large Sets of Numbers

English for Computer Science

Generating Functions

Final Exam May 8, 2018

2 Review of Set Theory

Recursively Enumerable Languages, Turing Machines, and Decidability

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Introduction to Sets and Logic (MATH 1190)

From Bayesian Notation to Pure Racket *

Time Complexity of an Algorithm

Random Simplicial Complexes

Notes on Turing s Theorem and Computability

Mathematics Background

Understanding Recursion

The Intersection of Two Sets

CSCI 270: Introduction to Algorithms and Theory of Computing Fall 2017 Prof: Leonard Adleman Scribe: Joseph Bebel

MITOCW watch?v=yarwp7tntl4

Objective. Vocabulary. 1.1: Sets of Numbers. 1-1 Sets of Numbers

Lecture 1: Overview

CS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia

CSE 120. Computer Science Principles

SET DEFINITION 1 elements members

6c Lecture 3 & 4: April 8 & 10, 2014

Vocabulary: Looking For Pythagoras

TAFL 1 (ECS-403) Unit- V. 5.1 Turing Machine. 5.2 TM as computer of Integer Function

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

Critical Analysis of Computer Science Methodology: Theory

CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism

(Refer Slide Time 3:31)

1.7 The Heine-Borel Covering Theorem; open sets, compact sets

Computer Sciences Department

COMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS

What computers just cannot do. COS 116: 2/28/2008 Sanjeev Arora

CHAPTER 4. COMPUTABILITY AND DECIDABILITY

Homework Set #2 Math 440 Topology Topology by J. Munkres

TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO

CS103 Handout 50 Fall 2018 November 30, 2018 Problem Set 9

Recursive Function Theory

the Computability Hierarchy

In this section we will study problems for which we can prove that there is no algorithm solving them.

6. Advanced Topics in Computability

Scope and Sequence for the New Jersey Core Curriculum Content Standards

Computability Mechanizing Reasoning

Let A(x) be x is an element of A, and B(x) be x is an element of B.

Transcription:

Nagual and Tonal Maths: Numbers, Sets, and Processes Lukas A. Saul Oxford, England May, 2015 Abstract: Some definitions and elementary theorems are given here describing tonal and nagual numbers, sets, and processes. Mea Culpa The bulk of this work consists of a rebranding of computable and uncomputable numbers as tonal and nagual numbers. The intent is that armed with a different vocabulary, we will be motivated to return to the fields of numbers before us and try to improve our understanding of their categories. So rather than there's nothing new under the sun, the reader is encouraged to think let's take another look anyway. Definition 1 A nagual number is one which has no finite representation. Such a number is not computable, and displays Martin-Löf randomness. That is, its digits form an algorithmically random sequence. More formally: Definition 2 Consider where and we say A i is the i th digit of n, then n is nagual. By suitably extending the range of the indices i in Definition 2 we can easily extend the definition for n<-1 or n>1 (see Definition 5). Definition 3 A tonal number is one which has a finite representation.

Definition 4 where and we say A i is the i th digit of n, then n is tonal. Definition 5 Consider where and we say A j, B j are the j th complex digits of z, then is nagual. That is to say, if a complex number z has either its real or imaginary component nagual, we say it also is nagual. The double sided infinite sum is used here for simplicity, these could also be written from 0 using an appropriate change of variables. Do nagual numbers exist in? The first thing to note is that if they don't exist, then then the cardinality of is no longer ; for the list of programs p is of cardinality. Theorem 1 If > then which are nagual. The statement holds for not only the reals but any set for which the cardinality is larger than that of the natural numbers,. An example might be the power set of the natural numbers. Theorem 2 The set of all tonal numbers can be put in a one to one correspondence with a subset of the integers.

It is worth asking for a rigorous definition of the object. Any suitable language can be chosen for interpreting a program p. There exist perhaps more suitably compact languages with only a few symbols needed, known as Turing tarpits. However even a high level language can do the trick of making a one to one correspondence between the set of all programs that produce streams of digits A i, and a subset of the integers. The canonical procedure is to map an integer p to an output is as follows: // //Comp(p,i) script decompress(p) >p.src compile(p.src) >p.bin execute(p.bin, i) For most integers p, this will fail to decompress, fail to compile, or fail to execute and return a valid integral result. However one can point to other integers p which produce from this for example the i th digit of pi, rather tidily using the Bailey Borwein Plouffe formula. We might note that searching for integers which are compressed source code representing real numbers is unfeasible. For example, there is no way to know a priori if a given computation which reaches execution will even halt. For these reasons it could be impossible to prove some numbers to be nagual. However, it is easy to disprove that a number is nagual. One must only demonstrate that the number is tonal, that is to show a finite computer program the represents the number exactly. Definition 6 A nagual set is a set of elements which has no finite representation. The elements of a nagual set themselves can be of any class. For example, one might consider nagual sets of integers. If we claim that the power set of the integers is uncountably infinite, then we must admit that this power set contains nagual sets. If uncountable, it contains sets other than those which could be represented by finite computer programs. Just because a set contains nagual numbers does not mean it is uncountable. There can be finite and countably infinite sets which contain nagual numbers. If we take two nagual numbers n 1 and n 2 we can form a finite set like {n 1,n 2 }, or a countably infinite set { }. Definition 7 A process is considered nagual if its instruction set is not possible to represent in finite space. A running nagual process is a running process whose instruction set is necessarily infinite, which is to say it has no beginning and if allowed to continue has no end. More precisely: the nagual process is

one for which there is no finite program or instruction set that can be represented in finite time which duplicates its behavior. An oracle is also a nagual process. One utility of the concept of a nagual process may lie not in actual implementation but in approximation, in a similar manner to the way one approximates a wire as an infinitely long line of current density for the purposes of calculating electric fields. Examples 1) Speed of light (c) - Tonal. Don't be fooled by the dimension (meters/second). This number is a definition, it is specified exactly and hence is tonal. 2) Ratio of frequencies of a Pythagorean Perfect Fifth - Tonal. This is the rational number 3/2. 3) Ratio of frequencies of a Even Tempered Fifth - Tonal. This is the irrational but tonal number. 4) Ratio of frequencies of a Fifth played by any real instrument - Nagual (but without proof). It's unclear your instrument could be perfectly measured or simulated in finite time. 5), the Euler-Mascheroni constant - Tonal. While no proof exists that this number is transcendental, it is a perfectly well defined tonal number. 6), the fine structure constant Nagual (but without proof). It is still possible that some physical constants such as Plank's constant will wind up being tonal but at the moment these are measured values. Same with the gravitational constant. There is much more to be said about the different classes of machine which we have used in these definitions. One way to describe the limitations of is that it's execution must be a nagual process. For example, one might try to construct a new diagonal number not in the set of all tonal reals by creating a program: // return a digit of N input i return Comp(i,i)/2 This new number differs from the output of every program at the i th digit by a factor of 2. Therefore,

it is nagual. However, here is the program right here, it must be tonal. What happened? What happened is that we have assumed that we can simulate the output in a new program. In fact we don't know a priori when this machine will halt or cycle forever. For the purposes of constructing a program to represent a number, this does not represent a finite instruction set. This leaves only one option, which is that is nagual. In fact the way we have constructed is very similar to the way one might define a program that solves the halting problem. Consider another number whose digits are defined as follows: // return a digit of M input i if (Comp(i,1)!=null) return 1 else return 0 This program produces a number whose i th digit is 1 if i itself is a program that halts and 0 otherwise. Other examples of nagual numbers are Chaitin's constants. The busy beaver series is a nagual series. Discussion What, then, is the nagual? The nagual is the part of us which we do not deal with at all. The nagual is the part of us for which there is no description - no words, no names, no feelings, no knowledge. The nagual is not experience or intuition or consciousness. Those terms and everything else you may care to say are only items on the island of the tonal. The nagual, on the other hand, is only effect. The tonal begins at birth and ends at death, but the nagual never ends. The nagual has no limit. I've said that the nagual is where power hovers; that was only a way of alluding to it. By reasons of its effect, perhaps the nagual can be best understood in terms of power. Carlos Casteneda, Nagual and tonal are derived from Nahuatl words, for which there are some different meanings attributed in various literature. It is hoped that their incorporation here will not only help to elucidate the concepts of computable and uncomputable numbers, but also that the study of these numbers can help to elucidate the concepts of the nagual and the tonal. One coherent thread amongst their meanings is that the nagual is associated with something that is somehow beyond the human experience. We might say that one cannot fit it all in the head. The ideas of uncountability and uncomputability also fit nicely into this framework.