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

Lecture

Practical Machining Internship

Description

This lecture presents a practical machining internship at ETML - Ecole Technique des Métiers de Lausanne, aimed at second-year bachelor students in Microengineering. The internship provides an opportunity to apply theoretical knowledge, learn machine operation, and receive hands-on experience with guidance and support.

Official source

Related concepts (6)

Machining

Machining is a process in which a material (often metal) is cut to a desired final shape and size by a controlled material-removal process. The methods that have this common theme are collectively called subtractive manufacturing, which utilizes machine tools, in contrast to additive manufacturing (3D printing), which uses controlled addition of material. Machining is a part of the manufacture of many metal products, but it can also be used on other materials such as wood, plastic, ceramic, and composite material.

Milling (machining)

Milling is the process of machining using rotary cutters to remove material by advancing a cutter into a workpiece. This may be done by varying directions on one or several axes, cutter head speed, and pressure. Milling covers a wide variety of different operations and machines, on scales from small individual parts to large, heavy-duty gang milling operations. It is one of the most commonly used processes for machining custom parts to precise tolerances. Milling can be done with a wide range of machine tools.

Turing machine

A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm. The machine operates on an infinite memory tape divided into discrete cells, each of which can hold a single symbol drawn from a finite set of symbols called the alphabet of the machine. It has a "head" that, at any point in the machine's operation, is positioned over one of these cells, and a "state" selected from a finite set of states.

Universal Turing machine

In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Common sense might say that a universal machine is impossible, but Turing proves that it is possible. He suggested that we may compare a man in the process of computing a real number to a machine which is only capable of a finite number of conditions q 1: q 2 . ....

In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. The register machine gets its name from its use of one or more "registers". In contrast to the tape and head used by a Turing machine, the model uses multiple, uniquely addressed registers, each of which holds a single positive integer.

Related lectures (4)

Router Tutorial: Student Trials

Focuses on practical router usage, troubleshooting, and machine operation.

Machine Usage Basics

Covers the practical aspects of using a Fehlmann type picomax machine, emphasizing tool handling, precision adjustments, and maintenance procedures.

Machine Usage Basics

Covers the practical aspects of machine operation, including precision adjustments, tool changing, maintenance, and basic programming functions.

Mechanical Design Principles: Representation and Manufacturing Processes

Discusses mechanical design principles, focusing on representation rules and machining processes for effective production.

Related concepts (6)

Machining

Milling (machining)

Turing machine

Universal Turing machine