Filtered 
-modules over a 
-adic field 
 are semi-linear  objects which are easy to define and can be implemented on a computer. The modules 
 defined by 
-adic Hodge theory, where 
 is a  
-adic representation of the absolute Galois group of 
, provide  examples of filtered 
-modules. When 
 is nice enough  (semi-stable), the data of 
 is sufficient to recover 
. A  necessary and sufficient condition for a filtered 
-module 
  to be written as 
 for some semi-stable representation 
 is  the condition of "admissibility" which imposes conditions on the way the  different structures of the 
-module interact with each other.
In a joint work with Xavier Caruso, we try to provide an algorithm which  takes a filtered 
-module as an input and outputs whether it  is admissible or not. I will explain how we can implement filtered  
-modules on a computer and why this question is well posed.  I will then present an algorithm which answers the question if the  
-module is nice enough and explain the difficulties we are  facing both in this nice case and in the general case.