All
monster_resized.mov
Result of Assignment 1b - Stop Motion Animation (Animation Techniques, HND IM)
Added on 03.02.2010 by Jana Satoriova
kazatchok_final_SOUND_INCLUDED_full.avi
Result of Assignment 1c - Flash Animation (Animation Techniques, HND IM)
Added on 30.01.2010 by Jana Satoriova
LECTURE ---> Fractal Geometry: Algorithms and Beauty
Join us for an open lecture by Stefano Cavagnetto which illustrates some of the ideas underpinning work by Prague College staff and students this semester across the disciplines of art and computing. Prague College Studios | Polska 26 Thursday, January 28 Starts at 6:30 pm The main aim of this talk is to illustrate how algorithms effectively generate an amazing world of fractals. Classical Euclidean geometry deals with objects which exist in integer dimensions; fractal geometry works with objects in non-integer dimensions. While Euclidean geometry is a description of lines, curves, ellipses, etc. fractal geometry is described in algorithms, i.e. set of instructions. These set of instructions might produce rough or fragmented geometric shapes that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole (Mandelbrot, 1982). The overall process gives rise to an unexpected beauty which can be depicted by beautiful shapes.
Added on 27.01.2010 by Events Prague College
String Rewriting and Proof Complexity: an interpretation of Resolution
In this paper we give a new interpretation using string rewriting systems of the proof system Resolution in its tree-like and sequence-like versions. Also we give a geometric meaning to the interpretation using planar diagrams. [preprint available in pdf]
Added on 14.01.2010 by Stefano Cavagnetto
The Lengths of Proofs: Kreisel’s conjecture and Godel’s speed-up theorem
We collect and compare several results which have been obtained so far in the attempts to prove a statement conjectured by Kreisel, about the lengths of proofs. We also survey several results regarding a speed-up theorem announced by Goedel in an abstract published in 1936. Finally we connect this to Kreisel's conjecture. [preprint available in pdf]
Added on 14.01.2010 by Stefano Cavagnetto
Applications of Propositional Logic to Cellular Automata
In this paper we give a new proof of Richardson’s theorem : a global function G_{A} of a cellular automaton A is injective if and only if the inverse of G_{A} is a global function of a cellular automaton. More- over, we show a way how to construct the inverse cellular automaton using the method of feasible interpolation. We also solve two problems regarding complexity of cellular automata formulated by Bruno Durand.[preprint available in pdf]
Added on 14.01.2010 by Stefano Cavagnetto
The Conception of the Self in Multiple Cyber Worlds
In this paper we discuss many issues about personal identity and we propose a model of the Self in the Cyberspace based on information theory. This work combines some concepts from information theory, Dennett theory of multiple drafts with the concept of liminod as proposed by Victor Tucker in 1964.[preprint available in pdf]
Added on 14.01.2010 by Stefano Cavagnetto
Interactive Media Final Show 2010
The Prague College Interactive Media Department would like to announce a diploma show of our latest graduates! The show will be held from January 11 – 14 in the Prague College Studios, Polská 26 (entrance from Buděčská street). We would like to invite you to the vernissage which will take place on January 11 from 19:00 at The Studios The Interactive Media Final Show 2010 will present the work of 3 students from Czech Republic, Sweden and Slovakia. You will have a chance to see various 2D/3D animations, videos, printed graphics, web designs, photos and interactive installations based on midi protocols including brainwaves interface. Find out more about the show and the graduates ----> http://www.finalshow.info
Added on 11.01.2010 by Events Prague College
