Selfreference exclusion and Feynman path integral Dainis Zeps Institution of Mathematics and Computer Science

Slides:



Advertisements
Similar presentations
1 Signals and Systems Fall 2003 Lecture #2 9 September ) Some examples of systems 2) System properties and examples a) Causality b) Linearity c)
Advertisements

Heuristic Search techniques
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Clarke, R. J (2001) S951-02: 1 Critical Issues in Information Systems BUSS 951 Seminar 2 Theories and their Methods.
Self-reference systems Dainis Zeps University of Latvia Institution of Mathematics and Computer Science.
OOP - Object Oriented Programming Object Oriented Programming is an approach to programming that was developed to make large programs easier to manage.
Team Task Choose 1 Progression to READ: Number and Operations--Fractions Ratios and Proportional Relationships Develop “Content” Knowledge.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Essentials of interaction diagrams Lecture Outline Collaborations Interaction on collaboration diagrams Sequence diagrams Messages from an object.
CSE 830: Design and Theory of Algorithms
Role and Place of Statistical Data Analysis and very simple applications Simplified diagram of scientific research When you know the system: Estimation.
II–2 DC Circuits I Theory & Examples.
4. The Postulates of Quantum Mechanics 4A. Revisiting Representations
Role and Place of Statistical Data Analysis and very simple applications Simplified diagram of a scientific research When you know the system: Estimation.
Foundations This chapter lays down the fundamental ideas and choices on which our approach is based. First, it identifies the needs of architects in the.
Measuring Social Life Ch. 5, pp
Data Structures Lecture-1:Introduction
Three Generative grammars
Requirements of a Philosophy of Money and Finance John Smithin York University.
On Roles of Models in Information Systems (Arne Sølvberg) Gustavo Carvalho 26 de Agosto de 2010.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Definition of a System Examples Causality Linearity Time Invariance.
PROCESS MODELING Chapter 8 - Process Modeling
Towers of Hanoi. Introduction This problem is discussed in many maths texts, And in computer science an AI as an illustration of recursion and problem.
Funding provided by NSF CHN Systems BioComplexity Grant.
CS 490 Mathematical Logic, Combinatorics, Counting Arguments, Graph Theory, Number Theory, Discrete Probability, Recurrence Relation. Thao Tran.
Signal and Systems Prof. H. Sameti
Welcome to AP Biology Mr. Levine Ext. # 2317.
SOFTWARE DESIGN.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Definition of a System Examples Causality Linearity Time Invariance Resources:
Software Engineering Prof. Ing. Ivo Vondrak, CSc. Dept. of Computer Science Technical University of Ostrava
Design Concepts By Deepika Chaudhary.
EEE 301 Signal Processing and Linear Systems Dr
Selected Teaching-Learning Terms: Working Definitions...
GRAPHS THEROY. 2 –Graphs Graph basics and definitions Vertices/nodes, edges, adjacency, incidence Degree, in-degree, out-degree Subgraphs, unions, isomorphism.
 What is Modeling What is Modeling  Why do we Model Why do we Model  Models in OMT Models in OMT  Principles of Modeling Principles of Modeling 
Intro to Scientific Research Methods in Geography Chapter 2: Fundamental Research Concepts.
FDT Foil no 1 On Methodology from Domain to System Descriptions by Rolv Bræk NTNU Workshop on Philosophy and Applicablitiy of Formal Languages Geneve 15.
SOFTWARE DESIGN. INTRODUCTION There are 3 distinct types of activities in design 1.External design 2.Architectural design 3.Detailed design Architectural.
Dr. Wang Xingbo Fall , 2005 Mathematical & Mechanical Method in Mechanical Engineering.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Architecture View Models A model is a complete, simplified description of a system from a particular perspective or viewpoint. There is no single view.
The Architecture of Systems. System Architecture Every human-made and natural system is characterized by a structure and framework that supports and/or.
Week 04 Object Oriented Analysis and Designing. What is a model? A model is quicker and easier to build A model can be used in simulations, to learn more.
 In this packet we will look at:  The meaning of acceleration  How acceleration is related to velocity and time  2 distinct types acceleration  A.
Quantum Two 1. 2 Many Particle Systems: An Introduction to Direct Product Spaces 3.
Lecture 14 22/10/15. The Object-Oriented Analysis and Design  Process of progressively developing representation of a system component (or object) through.
Basic properties Continuation
Lecture №1 Role of science in modern society. Role of science in modern society.
Yr 7.  Pupils use mathematics as an integral part of classroom activities. They represent their work with objects or pictures and discuss it. They recognise.
1 “Figures and images used in these lecture notes by permission, copyright 1997 by Alan V. Oppenheim and Alan S. Willsky” Signals and Systems Spring 2003.
CS223: Software Engineering Lecture 13: Software Architecture.
Chapter 1 Children, Science, and Inquiry. Why should children learn science? Science provides opportunities for children to: Exercise their curiosity.
From Use Cases to Implementation 1. Structural and Behavioral Aspects of Collaborations  Two aspects of Collaborations Structural – specifies the static.
CSCI 383 Object-Oriented Programming & Design Lecture 7 Martin van Bommel.
#1 Make sense of problems and persevere in solving them How would you describe the problem in your own words? How would you describe what you are trying.
Riyadh Philanthropic Society For Science Prince Sultan College For Woman Dept. of Computer & Information Sciences CS 251 Introduction to Computer Organization.
From Use Cases to Implementation 1. Mapping Requirements Directly to Design and Code  For many, if not most, of our requirements it is relatively easy.
Copyright © 2014, 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Starting Out with C++ Early Objects Eighth Edition by Tony Gaddis,
Logic.
OOP - Object Oriented Programming
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
CSE202: Introduction to Formal Languages and Automata Theory
DATA MODELS.
 DATAABSTRACTION  INSTANCES& SCHEMAS  DATA MODELS.
Quantum One.
Quantum One.
Presentation transcript:

Selfreference exclusion and Feynman path integral Dainis Zeps Institution of Mathematics and Computer Science

Self-reference systems Let us differentiate in a system’s behviour the part of its elements being with themselves and the part where they interact between themselves. The same system we may now consider as consisting from self-reference elements which are with themselves unless they are in interaction. May we consider all our system now as some sort of self-reference system itself, consisting from self-refernce elements, or systems on their own rights? Definition: self-reference system, or idem [pronounced ‘aidəm] is a pair:, where system in state s 1 is with itself and in state s 2 it interacts with anything without itself. Simplest example: colliding balls: Ball’s life between collisions: its state s 1 or its selfreference Ball’s state s 2 : In its life act of experience or interaction Ball’s life Ball’s life consists from selfreferences and experieces or interactions

Lifetime story Let us consider system’s behaviour, excluding its selfreference part from consideration, considering only its experience part, and call it lifetime story. In one element’s life its lifetime story would be sequence of experiences or interactions forming its lifetime experience. What structure should possess lifetime story of all system and how to compute it? Structure is multigraph. Computation technique is Feynman path integral.

LTS structure - multigraph All lifetime stories of individual elements of the system comprise on lifetime story that is multi-graph in very natural way, and mathematically too, Multigraph reveals additional properties of the system that could usually remain unnoticed: how links are synchronized between similar experiences. Solving the problem usually, we consider it in temporal outline, i.e., guided by the very basical low in nature, i.e., causal relations’ low. But chosing some other rather noncausal shema we could find more general outline for our theory. One more unnoticed property of every mathematical problem: It may be made cyclical in very natural way, i.e., in the way we depict multigraph on orientable surface. See left and imagine surfice which could saddle on it this multigraph.

Feynman path integral What to do in a general case, when multigraph technique is not appropriate, e.g., if we have smooth functions, and selfreference elements actually are taken from infinitisimal picture in order to result in continued macropicture? Then general technique is that taken from quantum electrodinamics – Feynman path integral technique, that has many applications in other scientific disciplines. First we take integral path from point a to point b of ‘system life’s’ manifold and thenafter vary points a and b over all points of the manifold. We receive the same cyclicity. What to do with noncausalities it is problem of its own, e.g., we may chose patterns, if any, from QED or build ourselves appropriate for our problems. In QED Feynman path integral is applied in some ultimate way without excluding anything, unless inifinizimal picture - using some philosophical mood. We are going to use Feynman path integral appoach in sense of some general pattern, considering multigraph case as its simpler subcase, to exclude selfreferences actually and to try to find some general patterns of such exclusion.

Manifold of partial reality with exclusion Let for example system consists of n independent blocks uless time to time communicating between themselves. We may describe each such block as idem and find system’s lifetime story with respect to these idems. We get multigraph which made into some smooth function called manifold of reality represents now systems action what concerns interconnection of their blocks where the actual actions of their blocks are excluded. Manifold of reality, or partial reality with some excluded part of reality, defined in this way always represents only some aspect of the imaginable common reality wheresoever. However, this partial reality is something quite precisely conceivable and, according quantum mechanical conceptuality, it is in superposition with that common imaginable reality even if we in no way could define it precisely, what should under it be understandable. If a system is sufficiently complicated it would have several levels of its partial realities, each representing its own complexity and competence. Each level characterizes specified selfreference which excludes references that are included in it as its substructure. Hierarchical system organized in this way could be representable as references, where higher reference excluding all lower defines itself, but, on the other hand, excluded itself, shows higher organization of the system.

Abstractions from simpler facts Previously we considered system consisting from elements that were conceivable as idems and came to idem of all system. Using this approach, we follow the general pattern in mathematics, where, similarly as function is defined in its domain, our elementary idem is defined on all system. However, we have another choice too. I.e. We find some idem and, without defining directly its domain, get it to know through lifetime story where, calculated using Feynman path integral, it gives us, among other things, domain where our idem works. Even more, we may not even know directly what it is, the domain where our idem works. Lifetime story computation always can do the job. Until, of course, very curious cases, when this domain is empty and all as if works and it doesn’t work together, because lifetime story comprise some empty structure.

All that happen with vector bundles, gauging and whatsoever pilings of mathematical nature via connections, where heaps on heaps mathematical constructs are heaped one to another, all this works by a simple principle where every stratum is selfreferent where by itself’s exclusion joines into another picture. Selfreference - Inclusion via excluding oneself