computability
Theory of Computation: Partially Computable and Computable Functions (Part 01)
1. Partial functions 2. Partially computable functions 3. Class web page is at vkedco.blogspot.com 4. References: Ch. 2, "Computability, Complexity, and Languages" by Davis, Weyuker, and Sigal 5. Video narration: Vladimir Kulyukin
Dan Says - Introductory Computability Theory - Turing Machine Introduction 1
Hello everybody! I am discussing an introduction to Turing Machines and why this machine is important to today and Computer Science. Developed by the father of Computer Science Alan Turing. (one of my heroes). I also explain the Halting Problem.
The Answer Man
A Schoolhouse Rock-style video that presents the halting problem and computability. Created for use in an introductory computer science class at Rutgers University (NJ, USA). Tune: Piano Man by Billy Joel
Dan Says - Introductory Computability Theory - Turing Machine Introduction 2
Hello everybody! I am discussing an introduction to Turing Machines and why this machine is important to today and Computer Science. Developed by the father of Computer Science Alan Turing. (one of my heroes). I also explain the Halting Problem.
Turing Centennial Conference: Turing, Church, Gödel, Computability, Complexity and Randomization
Turing, Church, Gödel, Computability, Complexity and Randomization Presented by Prof. Michael Rabin, Turing Award laureate, Hebrew University & Harvard University Alan M. Turing Centennial Conference - Israel April 4, 2012 The Wohl Centre Bar-Ilan University Ramat-Gan, Israel For more information see: sites.google.com
The Non-Computability of Human Brains
This is discussing why research into constructing computational brains is pointless, and why we really should be pouring our research dollars into just understanding the biological brain instead. I point out a very simple but correct argument to why computers and brains are not the same thing. I give a really simple argument, that is to really demonstrate the pointlessness of going after making brains on computers, and instead understand brains from a biological view, and understand components of the brain through computational analysis. Sure, the project maybe could give some insight into the mapping of it, but it will not succeed at the whole goal due to these limits of computation. Best to stick with the analysis and mappings of the components component of research for this, not the whole organ. A couple Research Projects which do include 'whole brain simulations': -Project Blue Brain (note there are some good parts to this project, just they really should not focus on the whole simulation component) bluebrain.epfl.ch -Hugo de Garis is a fellow who has been given a lot of money over the years for these things, and hasn't succeeded yet. Most recently 500 thousand dollars by the Chinese Government. Note: This is involving computational brains, not biological brains, that is a whole other discourse. Have a beautiful day!
Open-texture, computability, and Church's Thesis - Stewart Shapiro
The lecture of Stewart Shapiro, 'Open-texture, computability, and Church's Thesis', presented at the "Trends in Logic IX" conference - Church's Thesis: Logic, Mind and Nature, 3-5 June 2011, Kraków, Poland. The conference was co-organized by Copernicus Center for Interdisciplinary Studies. Photos: www.adamwalanus.pl
Customer Testimonial: Michael McMillin, President, Comput-Ability
"We're a five person company, we have 1200 customers" - Michael McMillin, President, Comput-Ability
Who is the "human computer" in Turing's analysis of computability? - Oron Shagrir
The lecture of Oron Shagrir, 'Who is the "human computer" in Turing's analysis of computability?', presented at the "Trends in Logic IX" conference - Church's Thesis: Logic, Mind and Nature, 3-5 June 2011, Kraków, Poland. The conference was co-organized by Copernicus Center for Interdisciplinary Studies. Photos: www.adamwalanus.pl
Theory of Computation: Unbounded Minimalization, Goldbach's Conjecture, & Partial Computability
1) Bounded & Unbounded Minimalization 2) Goldbach's Conjecture 3) Goldbach's Conjecture & Unbounded Minimalization 4) Unbounded Miniamlization & Partial Computability 5) Class home page is at vkedco.blogspot.com 6) Video Narration: Vladimir Kulyukin
Theory of Computation: Composition and Recursion (Part 01)
1) Scientific theories, primitives, and constructive devices 2) Function composition 3) Function composition of partially computable functions is partially computable 4) Function composition of computable functions is computable 5) Class web page is available at vkedco.blogspot.com 6) Reference: Ch. 3, Davis, Weyuker, Sigal. "Computability, Complextiy, and Languages," 2nd Ed., Academic Press 7) Video narration: Vladimir Kulyukin 8) Errors, comments to vladimir dot kulyukin at gmail dot com
Problems with Penrose and the Halting of Hameroff
A critique of the basic proposals of Penrose and Hameroff's objective reduction model of consciousness. Basic argument: (Penrose) Some things are "non-computable" Mathematitions overcome non-computability by "insight" Insight is "non-computable" Insight is central to understanding consciousness Insight and therefore consciousness require non-computable processes Quantum physics is non-computable Thus Quantum physics is responsible for consciousness (Hameroff) The microtubles may be related to consciousness Microtubles may act in macroscopic states of quantum entanglement Thus Microtubles acting in quantum entangled states are responsible for consciousness This argument is one I wish to refute (it can be found here in greater detail) Beyond Belief 2006 - Hameroff video.google.com Luckily, others agree with me: Dennett (Functionalist critique) ase.tufts.edu Grush and Churchland ( Neuroscience critique) mind.ucsd.edu McDermott ( AI critique) psyche.cs.monash.edu.au
MDM-L02T11-H: Complexity \ From Data to Information to Knowledge - Unsupervised Learning
Bar-Ilan University & The Chaim Sheba Medical Center - The Biomedical Informatics Program - and The Science Network of Medical Data Mining Course 80-665 - Medical Data Mining Spring, 2012 Lecturer: Dr. Ronen Tal-Botzer Lecture 02: From Data to Information to Knowledge - Unsupervised Learning Topic 11-Horizontal: Complexity & Computability Recording Date: March 12th., 2012 Filmed by Adi Zarchiany Produced by The Digital Photography Unit - Tamar Anker The Mina and Everard Goodman Faculty of Life Sciences and The Science Network of Medical Data Mining
George Odifreddi and Barry Cooper at CiE 2007 in Siena
George Odifreddi roped in Computability in Europe coordinator Barry Cooper as "reader" for his opening plenary talk at CiE 2007 in Siena - an interesting double act, never to be repeated ... (video captured by Benedikt Loewe)
Theory of Computation: Composition and Recursion (Part 04)
1. A constructive method of obtaining a total function from two other total functions by primitive recursion 2. Primitive recursion preserves computability: if a function is obtained from two other computable functions by primitive recursion that function is computable 3. Class home page is at vkedco.blogspot.com 4. Video narration: Vladimir Kulyukin
Quantum Computing and the Limits of the Efficiently Computable - 2011 Buhl Lecture
Scott Aaronson, an expert in the realm of computational complexity theory and the founder of ComplexityZoo.com online encyclopedia of computational complexity theory delivered Carnegie Mellon University's 2011 Buhl Lecture. In his lecture titled "Quantum Computing and the Limits of the Efficiently Computable," Aaronson discusses what quantum computers are, whether they can be built on a large scale, and what's known today about their capabilities and limitations. He goes beyond quantum computers to touch on speculative models of computation, including closed time-like curves and nonlinearities in the Schrodinger equation — an equation that describes how the quantum state of a physical system changes in time. An associate professor of electrical engineering and computer science at the Massachusetts Institute of Technology, Aaronson's work on the subject of quantum computing has included limitations of quantum algorithms in the black-box model, the learnability of quantum states, and quantum versus classical proofs and advice. He writes a popular blog (www.scottaaronson.com/blog). For more on the Buhl Lectures, visit: www.cmu.edu
Theory of Computation: Primitive Recrusively Closed Classes of Functions (Part 01)
1. Composition and primitive recursion as constructive methods 2. Does primitive recursion define computability? 3. Three primitives of the theory of primitive recursive functions 4. Definition of primitive recursively closed classes of functions 5. Class of computable functions is primitive recursively closed 6. Class home page is at vkedco.blogspot.com 7. Video narration: Vladimir Kulyukin 8. Errors, comments to vladimir dot kulyukin at gmail dot com
Theory of Computation: Composition and Primitive Recursion (Part 03)
1. Primitive recursion 2. If a function is obtained from a computable function by primitive recursion, the function is computable 3. Course web page is at vkedco.blogspot.com 4. Video narration: Vladimir Kulyukin 5. Errors, comments to vladimir dot kulyuiin at gmail dot com
Computabilidad, aleatoriedad y la Tesis de Church-Turing Física
El miércoles 19 de octubre de 2011 presenté una ponencia sobre computabilidad, aleatoriedad y su posible relación con la Tesis de Church-Turing Física, en el marco de las I Jornadas de Estudiantes de Filosofía de la Facultad de Filosofía y Letras de la UBA. La ponencia fue presentada en una mesa de Lógica y Filosofía del Lenguaje. Abstract: «Adam Olszewski (1999) propone que la Tesis de Church-Turing puede ser usada para refutar el platonismo matemático1. Para ello postula una máquina que al lanzar una moneda define una función que ―computa el valor (0 o 1) para la moneda n que se haya lanzado y dice que dicha función es efectivamente computable pero no Turing-computable. Entonces, dado que según el platonismo matemático (PM), toda función de enteros positivos a enteros positivos ya existe, existiría una función efectivamente computable pero no Turing-computable (computable por una máquina de Turing). Esto contradice a la Tesis de Church-Turing (CT) que dice que toda función efectivamente computable es Turing-computable. Por contraposición, si CT es verdadera, entonces PM es falso. Rafał Urbaniak (2011) critica este argumento desafiando la afirmación de que lo que esta máquina de hecho realiza sea una computación. Revisaré dicha crítica y detallaré algunos puntos de la misma. Además introduciré la noción de Tesis de Church-Turing Física.»
The Church-Turing Thesis: Story and Recent Progress
Google Tech Talk June 8, 2009 ABSTRACT Presented by Yuri Gurevich. The Church-Turing thesis is one of the foundations of computer science. The thesis heralded the dawn of the computer revolution by enabling the construct of the universal Turing machine which led the way, at least conceptually, to the von Neumann architecture and first electronic computers. One way to state the Church-Turing thesis is as follows: A Turing Machine computes every numerical function that is computable by means of a purely mechanical procedure. It is that remarkable and a priori implausible characterization that underlies the ubiquitous applicability of digital computers. But why do we believe the thesis? Careful analysis shows that the existing arguments are insufficient. Kurt Gödel surmised that it might be possible to state axioms which embody the generally accepted properties of computability, and to prove the thesis on that basis. That is exactly what we did in a recent paper with Nachum Dershowitz of Tel Aviv University. Beyond our proof, the story of the Church-Turing thesis is fascinating and scattered in specialized and often obscure publications. I will try to do justice to that intellectual drama. Yuri Gurevich is Principal Researcher at Microsoft Research in Redmond, WA. He is also Prof. Emeritus at the University of Michigan, ACM Fellow, Guggenheim Fellow, a member of Academia Europaea, and Dr. Honoris Causa of a couple of universities.
P vs. NP
Useful links: Stephen Cook's Introduction to the problem: www.claymath.org NP vs. P information: www.win.tue.nl . I want to note the recent proof link there refers to a proof which infact is not complete and is incorrect given what it has thus far. About NP-completeness: www.fact-index.com Some NP-complete problems (with proof): www.cs.uky.edu Proof of SAT to 3-SAT: www.google.ca The following video is a basic introduction to the P vs. NP problem from the theoretical computer science view. I hope this helps anybody curious about this problem. I personally consider P vs. NP an interesting problem worth venturing but, I think by it's not equal or equal nature it might be too hard to decide this question but, time will tell. There was a proof made in August, 2010 claiming they aren't equal but, I personally found lots of holes in it, and many leading figures have found lots of flaws and missing bits in it but, thus far it is a rejected proof. An important distinction to make is many confuse P vs. NP's properties with computability when it is actually a question related to intractability. Computability relates to the existence of Turing Machines and halting properties of theoretical machines based on the Church-Turing Thesis (in relation to Turing Degrees), while P vs. NP relates to the effectiveness of algorithms in settings based on complexity classes. Have a beautiful day! Note: When I refer to complexities in this video assume I am speaking about Time-Complexity not Space ...
Theory of Computation: What is Theory of Computation
1. The main question of theory of computation 2. What does "computed" mean anyway? 2. Computational devices 3. Algorithmics vs. Computability 4. Course home page is at vkedco.blogspot.com 5. Video Narration: Vladimir Kulyukin
Theory of Computation: Programming Language L (Part 01)
1. Formal specification of the programming language L defined in Chapter 2 of "Computability, Complexity, and Languages," 2nd Ed., by Davis, Weyuker, Sigal 2. L is a theoretical construct designed to mimic an assembly language 3. Sample L programs 4. Course web page is at vkedco.blogspot.com 5. Video narration: Vladimir Kulyukin
Theory of Computation: Primitive Recursively Closed Classes of Functions (Part 03)
1) The class of primitive recursive functions is primitive recursively closed 2) A function is primitive recursive if and only if it belongs to every primitive recursively closed class 3) Every primitive recursive function is computable 4) Class home page is at vkedco.blogspot.com 5) Video narration: Vladimir Kulyukin 6) Erros, comments to vladimir dot kulyukin dot gmail dot com
Nykytyne2's Determinism Thought Experiment Begs the Question
Determinism holds. The machine proposed would affect the system.. its predictions would affect Nykytyne2's actions -- the ones it's trying to predict -- so it must therefore also be able to predict its own actions. But we proposed this machine because the acting agent is unable to predict its own actions.. and now we're asking the machine to do the very thing we said it couldn't do. The only way for the machine to work is for it to not be part of the system (the Universe), but then it can't provide Nykytyne2 with its predictions (because those would be causal inputs to the system).. so the problem isn't with determinism, it's with the construction of the thought experiment itself. Determinism still holds. For computer science geeks, this is similar to the halting problem and other undecidable problems. The principle of computability in general still holds, there are just some problems that are practically-speaking unsolvable or uncomputable. This is my first real "talkie" video on YouTube, so it's nothing great but ya gotta start somewhere, right?
Wilfried Sieg @ IIMAS 06
Wilfried Sieg, de la Universidad Carnegie Mellon, el viernes 11 de marzo a las 10:00 en el auditorio del Instituto de Investigaciones en Matemáticas Aplicadas y Sistemas (edificio de la biblioteca). El Dr. Sieg es uno de los especialistas más destacados en temas de computabilidad y filosofía e historia de la computación y las matemáticas. En la siguiente liga se puede consultar su cv junto con varias de sus publicaciones: www.hss.cmu.edu Se anexa a continuación el resumen de la conferencia. Church without Dogma: What is a computation, and why does it matter? Notions of computations are used not only in computer science but also, eg, in cognitive psychology and philosophy of mind. The notions originate, however, from logical work in the 1930s. The talk is divided into three parts and ends with remarks about intelligent machinery, automated proof search and local axiomatics. The first part, Hilbert's Entscheidungsproblem, sketches the logical context in which a precise notion of computability was needed. Church's and Turing's theses assert dogmatically that the informal notion of effective calculability is captured by rigorous concepts, namely, general recursiveness and Turing machine computability. The second part, Turing's Proof, describes Turing's important argument showing that "what a computer can do" can be done by a Turing machine, where computer is understood in a surprising way. The argument leads to a methodological dilemma. That dilemma is addressed in the third ...
The "Highlights"
From the two people that run the "Computability" shop in the Town of Tredegar in the 90's.
Wilfried Sieg @ IIMAS 05
Wilfried Sieg, de la Universidad Carnegie Mellon, el viernes 11 de marzo a las 10:00 en el auditorio del Instituto de Investigaciones en Matemáticas Aplicadas y Sistemas (edificio de la biblioteca). El Dr. Sieg es uno de los especialistas más destacados en temas de computabilidad y filosofía e historia de la computación y las matemáticas. En la siguiente liga se puede consultar su cv junto con varias de sus publicaciones: www.hss.cmu.edu Se anexa a continuación el resumen de la conferencia. Church without Dogma: What is a computation, and why does it matter? Notions of computations are used not only in computer science but also, eg, in cognitive psychology and philosophy of mind. The notions originate, however, from logical work in the 1930s. The talk is divided into three parts and ends with remarks about intelligent machinery, automated proof search and local axiomatics. The first part, Hilbert's Entscheidungsproblem, sketches the logical context in which a precise notion of computability was needed. Church's and Turing's theses assert dogmatically that the informal notion of effective calculability is captured by rigorous concepts, namely, general recursiveness and Turing machine computability. The second part, Turing's Proof, describes Turing's important argument showing that "what a computer can do" can be done by a Turing machine, where computer is understood in a surprising way. The argument leads to a methodological dilemma. That dilemma is addressed in the third ...
Wilfried Sieg @ IIMAS 01
Wilfried Sieg, de la Universidad Carnegie Mellon, el viernes 11 de marzo a las 10:00 en el auditorio del Instituto de Investigaciones en Matemáticas Aplicadas y Sistemas (edificio de la biblioteca). El Dr. Sieg es uno de los especialistas más destacados en temas de computabilidad y filosofía e historia de la computación y las matemáticas. En la siguiente liga se puede consultar su cv junto con varias de sus publicaciones: www.hss.cmu.edu Se anexa a continuación el resumen de la conferencia. Church without Dogma: What is a computation, and why does it matter? Notions of computations are used not only in computer science but also, eg, in cognitive psychology and philosophy of mind. The notions originate, however, from logical work in the 1930s. The talk is divided into three parts and ends with remarks about intelligent machinery, automated proof search and local axiomatics. The first part, Hilbert's Entscheidungsproblem, sketches the logical context in which a precise notion of computability was needed. Church's and Turing's theses assert dogmatically that the informal notion of effective calculability is captured by rigorous concepts, namely, general recursiveness and Turing machine computability. The second part, Turing's Proof, describes Turing's important argument showing that "what a computer can do" can be done by a Turing machine, where computer is understood in a surprising way. The argument leads to a methodological dilemma. That dilemma is addressed in the third ...
Wilfried Sieg @ IIMAS 04
Wilfried Sieg, de la Universidad Carnegie Mellon, el viernes 11 de marzo a las 10:00 en el auditorio del Instituto de Investigaciones en Matemáticas Aplicadas y Sistemas (edificio de la biblioteca). El Dr. Sieg es uno de los especialistas más destacados en temas de computabilidad y filosofía e historia de la computación y las matemáticas. En la siguiente liga se puede consultar su cv junto con varias de sus publicaciones: www.hss.cmu.edu Se anexa a continuación el resumen de la conferencia. Church without Dogma: What is a computation, and why does it matter? Notions of computations are used not only in computer science but also, eg, in cognitive psychology and philosophy of mind. The notions originate, however, from logical work in the 1930s. The talk is divided into three parts and ends with remarks about intelligent machinery, automated proof search and local axiomatics. The first part, Hilbert's Entscheidungsproblem, sketches the logical context in which a precise notion of computability was needed. Church's and Turing's theses assert dogmatically that the informal notion of effective calculability is captured by rigorous concepts, namely, general recursiveness and Turing machine computability. The second part, Turing's Proof, describes Turing's important argument showing that "what a computer can do" can be done by a Turing machine, where computer is understood in a surprising way. The argument leads to a methodological dilemma. That dilemma is addressed in the third ...
A Turing Machine - Overview
A Turing machine is a math concept that show that a few simple rules can be used to solve any computable computation. It is the basis for all of today's computers. My goal in building this project was to create a machine that embodied the classic look and feel of the machine presented in Alan Turings 1937 paper on computable numbers. More information can be found at: aturingmachine.com
Incompleteness: A Personal Perspective
Google Tech Talks November 4, 2008 ABSTRACT Our aim is to present a personal view of Gdel's incompleteness. We will focus on interesting/natural concrete independent sentences, on the source of incompleteness, and on how common the incompleteness phenomenon is. Some open questions will be briefly stated. Speaker: Cristian Calude A lifelong researcher in algorithmic information theory and a close friend of Gregory Chaitin, Dr. Calude has written and edited dozens of books and hundreds of articles on computability and incompleteness.
The LEGO Turing Machine
A TV Shop themed demonstration of a Turing Machine made in LEGO Mindstorms. It was made as part of a project at computer science at Aarhus University. A blog about the project is available at legoofdoom.blogspot.com
how to control windows 7 from psp
this is me showing you how to put windows 7 on psp by using a program called pspdisp with will let you control your computer on your psp here is a link to where you can download it this also can work for vista there is a computability table on the site as well jjs.at
The Halting Problem - Part 2
Part two of a two-part video on a famous theoretical result in computer science: The Halting Problem. Cypherus is voiced by YouTuber 1GOD1JESUS - subscribe to his channel (or BURN!) www.youtube.com (not safe for work - VERY VERY not safe!)
Lecture 27 | Programming Methodology (Stanford)
Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami lectures on options and opportunities after his class. He shows students the path of majoring in CS and explains what each class will offer. CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Uses the Java programming language. Emphasis is on good programming style and the built-in facilities of the Java language. Complete Playlist for the Course: www.youtube.com CS106A at Stanford Unversity: www.stanford.edu Stanford Center for Professional Development: scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube www.youtube.com
Magic Software Video Case Study
Hear what our customers say about us: Tom Day from CBIA, Glenn Slater from Clinical Financial Services (CFS), Gary Banulski from Hedberg Data Systems, Roger Ross from Cornerstone Software, Michael McMillin from Comput-Ability and Varda Kahalani from the United Nations
Pioneers of Computer Science 2 Eindhoven University of Technology
www.CityTV.nl http From Turing to Harel part 2 Symposium Pioneers of Computer Science 2 Click here for part 1 youtu.be More info at www.tue.nl Start at 01:27. There are three main parts: I. 08:00 Computability, eg on finite structures rather than numbers and words; II. 36:34 Biological Modeling, eg the Whole Organism Project; III. 48:33 Artificial Intelligence, with a Turing Test for comprehensive modeling; IV. 1:03:39 Pipe Dream (2001) directed by Wayne Lytle. Honorary Doctorate for David Harel from TU/e On April 26th, ie, the day before David Harel received his honorary doctorate, TU/e hosted a symposium to honor professor Harel. The title of the symposium was "Pioneers of Computer Science: From Turing to Harel". Besides a keynote talk from Harel, there were invited talks by prof. Grzegorz Rozenberg (Leiden University), prof. Jan Friso Groote (TU/e), and prof. Jan van Leeuwen (Utrecht University). The title of Harel's keynote is "Standing on the Shoulders of a Giant: One Person's Experience of Turing's Impact". He will link his work to Alan Turing's pioneering and ingenious inventions. Turing, who was born 100 years ago, is generally seen as the founder of modern computer science. Some of the contributions of David Harel can be seen as continuations of Turing's work. Like Turing, Harel has done pioneering work in different fields of computer science. This explains the title of the symposium: "Pioneers of Computer Science: From Turing to Harel". Eindhoven University of ...
cellular automata: codd-devore-generations-wire world
epic cellular automata! A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. It consists of a regular grid of cells, each in one of a finite number of states, such as "On" and "Off" (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood (usually including the cell itself) is defined relative to the specified cell. For example, the neighborhood of a cell might be defined as the set of cells a distance of 2 or less from the cell. An initial state (time t=0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood. For example, the rule might be that the cell is "On" in the next generation if exactly two of the cells in the neighborhood are "On" in the current generation, otherwise the cell is "Off" in the next generation. Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known. Cellular automata are also called "cellular spaces", "tessellation automata", "homogeneous structures ...
Theory of Computation: Mathematical Preliminaries (Part 02)
1. Kleene Closures of Alphabets 2. The Empty Set vs. the Set with the Empty String 3. Set Former Notation 4. Course home page is at vkedco.blogspot.com 5. Video Narration: Vladimir Kulyukin
Homebrew channel (has no time limit)
yep no time limit..its the same one from Team Twiizers (wiibrew.org)except it was modified to not have the 10 minute time limit...also i know this video doesn't prove the 10 minute limit is gone (since youtube allows 10 minutes at a time...)but i assure you its not limited at all...i can upload a second video to prove it if really needed..but anyways..this also shows some of the game computability in the snes emulator (i was using the one with classic controller support) any questions? leave a comment...if u really want the channel (as in alot of people request it) i'll link it here.
Theory of Computation: Gӧdel Numbers (Part 03)
1) Gӧdel Numbering as a mathematical theory of program compilation and execution 2) Computation of Gӧdel Numbers is primitive recursive 3) Access function for Gӧdel Numbers 4) Class page is at vkedco.blogspot.com 5) Video narration: Vladimir Kulyukin
Wilfried Sieg @ IIMAS 03
Wilfried Sieg, de la Universidad Carnegie Mellon, el viernes 11 de marzo a las 10:00 en el auditorio del Instituto de Investigaciones en Matemáticas Aplicadas y Sistemas (edificio de la biblioteca). El Dr. Sieg es uno de los especialistas más destacados en temas de computabilidad y filosofía e historia de la computación y las matemáticas. En la siguiente liga se puede consultar su cv junto con varias de sus publicaciones: www.hss.cmu.edu Se anexa a continuación el resumen de la conferencia. Church without Dogma: What is a computation, and why does it matter? Notions of computations are used not only in computer science but also, eg, in cognitive psychology and philosophy of mind. The notions originate, however, from logical work in the 1930s. The talk is divided into three parts and ends with remarks about intelligent machinery, automated proof search and local axiomatics. The first part, Hilbert's Entscheidungsproblem, sketches the logical context in which a precise notion of computability was needed. Church's and Turing's theses assert dogmatically that the informal notion of effective calculability is captured by rigorous concepts, namely, general recursiveness and Turing machine computability. The second part, Turing's Proof, describes Turing's important argument showing that "what a computer can do" can be done by a Turing machine, where computer is understood in a surprising way. The argument leads to a methodological dilemma. That dilemma is addressed in the third ...
Wigner's Friend's Quantum Mind
EITHER minds can collapse wave-functions in the same way that unconscious measuring apparatuses can, OR substance dualism is true. Links: 1.) The Wigner's Friend thought experiment: en.wikipedia.org 2.) Penrose's lecture: www.youtube.com/watch?v=f477FnTe1M0 3.) Quantum computing in photosynthesis: www.scientificamerican.com 4.) Entanglement in bird migration: www.popsci.com 5.) Quantum Entanglement Holds DNA Together, Say Physicists: www.technologyreview.com 6.) Topological qubits in microtubules: www.youtube.com
MiLi Powerskin Review for the iPhone 3G and 3GS
www.powerskin.co.uk Product Specs Product Computability: iPhone 3G & 3Gs Capacity: 1200mAh (Li Pol) Standby Time: Up to 230 hours Talk Time: Up to 3.9 hours on 3G Internet Use: Up to 3.9 hours on 3G Audio Play: Up to 19 hours Video Play: Up to 5.4 hours L124 X W65 X T18MM
YOUNG GALAXY - BSE
Young Galaxy - "BSE" from the album "Shapeshifting". Black swan theory From Wikipedia, the free encyclopedia The black swan theory or theory of black swan events is a metaphor that encapsulates the concept that an event is a surprise (to the observer) and has a major impact. After the fact, the event is rationalized by hindsight. The theory was developed by Nassim Nicholas Taleb to explain: The disproportionate role of high-impact, hard-to-predict, and rare events that are beyond the realm of normal expectations in history, science, finance and technology The non-computability of the probability of the consequential rare events using scientific methods (owing to the very nature of small probabilities) The psychological biases that make people individually and collectively blind to uncertainty and unaware of the massive role of the rare event in historical affairs. Unlike the earlier philosophical "black swan problem", the "black swan theory" refers only to unexpected events of large magnitude and consequence and their dominant role in history. Such events, considered extreme outliers, collectively play vastly larger roles than regular occurrences.[1]
Theory of Computation: Gӧdel Numbers (Part 02)
1) Splitting a natural number into unique left and right components 2) Splitting functions l(x) and r(x) are primitive recursive 3) Formal definition of Gӧdel Numbers 4) Class home page is at vkedco.blogspot.com 5) Video Narration: Vladimir Kulyukin
Champagne Strings Trio
The Champagne Stiring Trio was establised by Albert Kocsis Conservatory of Hatvan in 2006. Members: Béla Baranyi (violin), József Pénzes (chello, piano), László Ürmös (viola, guitar, contrabass). Our main goal is connecting the modern world and classical music delicate performance, and with new ideas. The Trio's creed is to give fastidious recreation for every generation, and make the live-acoustic music popular. The band has many styles of music as like as our age's popular music, or the greatest classical composer's monumental masterpieces. Instead of performing compositions played by classical formations we are providing brand new tonality and repertoir to the audience. The main style elements of Champagne Strings Trio's are to combine different musical forms in one composition in the same time. For example a folk song puts you into the centre of many dimensions with the typical spicy harmony of jazz and with some elements from classical music. There is no computability in the normal way in our compositions, but they are still harmonical. With pressure and it's late solution makes the tonality complete. The Trio has many concerts in the country and also abroad. www.champagnestrings.eu
Page: 1 of 4
