Lecture

Inclusion of Fermented Foods in Food Guides

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ENG-436: Food biotechnology

The course will deliver basic knowledge on the principles of food fermentation and enzyme technology. The course will also present benefits that food biotechnology can bring in terms of Nutrition & Health and Sustainability. ...

Description

This lecture explores the inclusion of fermented foods in food guides around the world, discussing the benefits and risks associated with their consumption. It covers the history of food enzymes, the advantages of biocatalysts, and the kinetics of enzyme reactions. The lecture delves into the origin of enzymes, the history of food enzymes, and the advantages and disadvantages of biocatalysts. It also explains the kinetic behavior of enzyme reactions, the Lineweaver-Burk plot, and different types of enzyme inhibition.

Official source

Ontological neighbourhood

Chemistry

Biochemistry: Carbohydrates

Chemical reactions: Catalysis

Biology

Cell biology: Cell metabolism

Related concepts (32)

Type system

In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating point, string) to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term.

Type theory

In mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general, type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics. Two influential type theories that were proposed as foundations are Alonzo Church's typed λ-calculus and Per Martin-Löf's intuitionistic type theory. Most computerized proof-writing systems use a type theory for their foundation, a common one is Thierry Coquand's Calculus of Inductive Constructions.

Type safety

In computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is sometimes alternatively considered to be a property of facilities of a computer language; that is, some facilities are type-safe and their usage will not result in type errors, while other facilities in the same language may be type-unsafe and a program using them may encounter type errors.

Type inference

Type inference refers to the automatic detection of the type of an expression in a formal language. These include programming languages and mathematical type systems, but also natural languages in some branches of computer science and linguistics. Types in a most general view can be associated to a designated use suggesting and restricting the activities possible for an object of that type. Many nouns in language specify such uses. For instance, the word leash indicates a different use than the word line.

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Related lectures (64)

Collision Kinetics: Theory and Applications

Covers the theory and applications of collision kinetics in understanding molecular interactions.

Fermented Foods: Microbial Transformations and Health Benefits

Explores the microbial transformations and health benefits of fermented foods, emphasizing their potential as delivery vehicles for probiotics to underserved communities.

Enzymes: Basic Concepts and Kinetics

Delves into enzymes' basic concepts, kinetics, and catalytic strategies for reaction acceleration.

Food Fermentation Technology

Delves into the science of food fermentation, covering lactose metabolism, soy food fermentation, human milk production, kimchi making, and bacteria isolation.

Reservoirs and Dams: Hydraulic Construction and Sizing