Browse Source

readme: update build badge

pull/6904/head
osy 8 months ago
parent
commit
91a10dc052
  1. 2
      README.bn.md
  2. 2
      README.cz.md
  3. 2
      README.es.md
  4. 2
      README.fr.md
  5. 2
      README.ja.md
  6. 2
      README.ko.md
  7. 2
      README.md
  8. 2
      README.pl-PL.md
  9. 2
      README.ru.md
  10. 2
      README.uk.md
  11. 2
      README.zh-HK.md
  12. 2
      README.zh-Hans.md
  13. 2
      README.zh-Hant.md

2
README.bn.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> এমন মেশিন আবিষ্কার করা সম্ভব যা যেকোনো ধরনের সিকোয়েনশিয়াল গণনা করতে পারে তা যত কঠিন গণনাই হোক না কেন

2
README.cz.md

@ -1,6 +1,6 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> Je možné vynalézt jediný stroj, který lze použít k výpočtu libovolné vypočitatelné posloupnosti.

2
README.es.md

@ -1,6 +1,6 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> Es posible inventar una única máquina que pueda ser usada para computar cualquier secuencia computable. (It is possible to invent a single machine which can be used to compute any computable sequence.)

2
README.fr.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> Il est possible d'inventer une machine unique qui peut être utilisée pour calculer n'importe quelle séquence calculable. (It is possible to invent a single machine which can be used to compute any computable sequence.)

2
README.ja.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> It is possible to invent a single machine which can be used to compute any computable sequence.

2
README.ko.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> 계산 가능한 수열을 계산하는 단일 기계를 발명할 수 있습니다.(It is possible to invent a single machine which can be used to compute any computable sequence.)

2
README.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> It is possible to invent a single machine which can be used to compute any computable sequence.

2
README.pl-PL.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> Możliwe jest wymyślenie pojedynczej maszyny, której można użyć do obliczenia dowolnej sekwencji obliczeniowej.

2
README.ru.md

@ -1,6 +1,6 @@
# UTM
[![Статус](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)](https://github.com/utmapp/UTM/actions?query=event%3Arelease+workflow%3ABuild)
[![Статус](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)](https://github.com/utmapp/UTM/actions?query=event%3Arelease+workflow%3ABuild)
> Возможно изобрести [такую машину](https://ru.wikipedia.org/wiki/Универсальная_машина_Тьюринга), которая справится с любой вычислимой последовательностью.

2
README.uk.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> Можливо створити єдину машину, яку можна використовувати для обчислення будь-якої обчислювальної послідовності.

2
README.zh-HK.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> 發明一個可用於計算任何可計算序列的機器是可行的。
-- <cite>艾倫·圖靈(Alan Turing), 1936 年</cite>

2
README.zh-Hans.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> 发明一台可用于计算任何可计算序列的机器是可行的。
-- <cite>艾伦·图灵(Alan Turing), 1936 年</cite>

2
README.zh-Hant.md

@ -1,5 +1,5 @@
# UTM
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=master&event=push)][1]
[![Build](https://github.com/utmapp/UTM/workflows/Build/badge.svg?branch=main&event=push)][1]
> 發明一台可以用來計算任何可計算序列的機器是完全有可能的。

Loading…
Cancel
Save