Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Calcul du pi1 de XUCA

In course

MATH-225: Topology II - fundamental groups

On étudie des notions de topologie générale: unions et quotients d'espaces topologiques; on approfondit les notions de revêtements et de groupe fondamental,et d'attachements de cellules et on démontre le Théorème de Seifert-van Kampen. Des exemples de surf ...

Description

This lecture covers the calculation of the fundamental group of XUCA by building forms, defining applications, and ensuring compatibility of choices, leading to the quotient X XI JA XI alfa. The instructor explains the process step by step, illustrating with diagrams and equations.

Instructors (2)

Jérôme Scherer

Dimitri Stelio Wyss

Official source

Related concepts (11)

Backward compatibility

Backward compatibility (sometimes known as backwards compatibility) is a property of an operating system, software, real-world product, or technology that allows for interoperability with an older legacy system, or with input designed for such a system, especially in telecommunications and computing. Modifying a system in a way that does not allow backward compatibility is sometimes called "breaking" backward compatibility. Such breaking usually incurs various types of costs, such as switching cost.

Computer compatibility

A family of computer models is said to be compatible if certain software that runs on one of the models can also be run on all other models of the family. The computer models may differ in performance, reliability or some other characteristic. These differences may affect the outcome of the running of the software. Software compatibility can refer to the compatibility that a particular software has running on a particular CPU architecture such as Intel or PowerPC.

Binary-code compatibility

Binary-code compatibility (binary compatible or object-code-compatible) is a property of a computer system, meaning that it can run the same executable code, typically machine code for a general-purpose computer CPU, that another computer system can run. Source-code compatibility, on the other hand, means that recompilation or interpretation is necessary before the program can be run on the compatible system.

Source-code compatibility

Source-code compatibility (source-compatible) means that a program can run on computers (or operating systems), independently of binary-code compatibility and that the source code is needed for portability. The source code must be compiled before running, unless the computer used has an interpreter for the language at hand. The term is also used for assembly language compatibility, where the source is a human-readable form of machine code that must be converted into numerical (i.e. executable) machine code by an assembler.

Application software

An application program (software application, or application, or app for short) is a computer program designed to carry out a specific task other than one relating to the operation of the computer itself, typically to be used by end-users. Word processors, media players, and accounting software are examples. The collective noun "application software" refers to all applications collectively. The other principal classifications of software are system software, relating to the operation of the computer, and utility software ("utilities").

Related lectures (29)

Equilibrium Extension Analysis

Discusses equilibrium, extension analysis, stress distribution, and strain components' compatibility for a valid solution.

Compare Apple Watch vs Huawei Watch MOOC: IoT Systems and Industrial Applications with Design Thinking

Compares the hardware and sensing functionality of Apple Watch Series 2 and Huawei Watch 2.

Software Development: Versioning and Dependencies

Emphasizes the importance of versioning and dependencies in software development, highlighting continuous evolution and the need for compatibility.

Collections: Hashcode and Equals Methods

Explains the importance of hashcode and equals methods in Java.

Smooth sets and functions: Example - atlas for a circle