Login
Discover
Waves
Decks
Plus
Login
Signup
Topics
New
Trending
Hot
New
New
Trending
Hot
New
Payouts
Muted
Promoted
Global
Top communities
Create decentralized community
latest #tcs created topics on internet
chapter17art
comedy
2021-02-27 09:41
The CRINGE SHOW, Episode 9
Pink and Blue giving some life advice to Yellow.
$ 0.000
0
chapter17art
cryptoart
2021-02-26 06:55
The CRINGE SHOW, Episode 8
The heart loves what it loves.
$ 0.000
0
chapter17art
cringe
2021-02-25 08:59
The CRINGE SHOW, Episode 7
The classic one
$ 0.000
0
chapter17art
nft
2021-02-23 07:59
The CRINGE SHOW, Episode 5
Pink, Blue and their memories.
$ 0.000
0
comedyclubhouse
The Comedy Club
2026-03-29 19:02
Promoted
Com Contest Winners and New Contest || Poorly Used A.I (cc-wk38)
Com Contest Winners and New Contest || Poorly Used A.I (cc-wk38) WELCOME! The 37th week [cc-wk37] of the Com contest had just an entry, with an interesting weighing on **MONEY WITH CONSEQUENCES ** Gold🥇
$ 0.622
40
chapter17art
nft
2021-02-22 07:28
The CRINGE SHOW, Episode 4
Pink shows her preferences. Blue tries to score.
$ 0.000
0
markgritter
theory
2019-05-06 05:00
Existence properties for first-order number theory are all finitely checkable
OK, that's a mouthful. I wrote an answer to How can I show that a function is not computable over at Quora, which brought up the Busy Beaver function. BB(n) is a typical example of a non-computable function.
$ 0.647
314
1
changingworld
dlike
2019-04-16 15:46
TCS gifts wristwatches to its workers, they don’t like it. Want jewellery, home instead - Business News
Employee of tcs the biggest IT Firm are disappointed from the gifts they have got at 50th year celebration of the company. Source of shared Link
$ 0.000
4
aevaran
benefit
2019-04-13 10:45
TCS Walk Quarter Benefit At Rs. 8,126 Crore, Beats Examiners' Appraisals
Tata Consultancy Services (TCS) on Friday reported a net profit of Rs. 8,126 crore for the quarter ended March 31, 2019, beating analysts' estimates. That marked growth of 0.3 percent from its record net
$ 0.000
2
4
kriptux
Liketu
2026-04-02 06:27
Promoted
Koi
El pez Koi, originario de Asia (principalmente Japón) es símbolo de Prosperidad, Abundancia, Éxito y Suerte 🍀 ¿Lo conocías?
$ 0.000
2
shreyasgkamath
blockchain
2019-03-15 01:57
TCS to drive blockchain technology
TCS to drive blockchain reception 1 min read . 14 Mar 2019 IANS The new TCS arrangements will utilize Microsoft Azure Blockchain Cloud TCS has been effectively conveying its "Quartz Blockchain
$ 0.000
0
1
markgritter
steemstem
2018-12-17 04:19
What does the AC0 complexity class mean?
AC^0 is a circuit complexity class. It represents the set of decision problems that are solvable with a family of constant-depth unlimited-fanin polynomial-size circuits. Photo by Yung Chang on Unsplash.
$ 1.288
212
4
markgritter
chess
2018-11-24 01:47
Generalized Chess is PSPACE-Complete
The paper "On the complexity of chess" by James A Storer is available online, and it’s fairly readable. It demonstrates that deciding the winner in chess (expanded to NxN boards, with correspondingly
$ 0.084
16
markgritter
tcs
2018-11-20 09:47
What makes any NP-complete problem also a PSPACE problem?
For any f(n), DTIME(f(n)) ⊆ SPACE(f(n)). This is because if you run for f(n) steps you can write to at most f(n) locations. (The reverse, of course, is not true.) The same applies for nondeterministic
$ 0.930
170
1
aljif7
Education
2026-04-04 04:22
Promoted
A Daily Word in Spanish (#362)
Autopista (la) Blog de @aljif7 PLATAFORMA: Hive FECHA: Viernes 3 de abril de 2026. Área: Educación-Aprendizaje. A Daily Word in Spanish (#362)-Autopista (la) (Sources: Educalingo, a Pictionary, Wikipedia
$ 0.107
17
markgritter
steemstem
2018-11-17 20:38
An impractical reduction: factoring->3SAT->SUBSETSUM
The Subset Sum problem is NP-complete, but what does a reduction from another problem actually look like? I set out to create a concrete example. Let's start with factoring. What are the factors of 91?
$ 2.890
270
1
markgritter
mathematics
2018-10-28 00:54
Integers with low Kolmogorov complexity
I found this cute sequence in the Online Encyclopedia of Integer Sequences: A168650: Integers that can be generated with a C/C++ expression that is shorter than their decimal representation. The
$ 2.487
178
3
markgritter
steemstem
2018-10-02 05:17
Two Proofs of the Undecidability of the Halting Problem
The Halting Problem is whether or not a given Turing machine halts on a given input. This is the classic example of an undecidable problem, one that no Turing machine can accurately and completely solve.
$ 12.764
208
3
markgritter
mathematics
2018-09-08 17:43
Asymptotic Bounds You May Not Have Learned In School
Computer Science education teaches "Big O" notation for describing complexity upper bounds, and Big-Theta and Big-Omega get introduced as well. Mathematicians and complexity theorists sometimes
$ 4.320
171
4
ydaiznfts
Hive Gaming
2026-04-04 16:30
Promoted
Aguasturbias at 10 again, let's go - Teamfight Tactics - [ESP/ENG]
Image created in Canva Source Source Bienvenidos gamers de Hive, jugando esta hermosa partida de Teamfight Tactis nos dimos la aventura de intentar llevar nuevamente el rasgo "aguasturbias" al 10, y con
$ 2.626
132
markgritter
steemstem
2018-09-07 00:45
Lower bounds on time complexity
I'm (slowly) continuing to read The Computational Complexity of Logical Theories, and it came in useful answering this Quora question: Can we predict [time] complexity before writing an algorithm? Here's
$ 4.308
161
2
markgritter
steemstem
2018-08-23 22:11
Leonid Levin's Universal Algorithm
There's an algorithm which solves SAT instances in polynomial time, if and only if P=NP. If P=NP, then it runs in polynomial time. If P is not equal to NP, it runs in the best possible non-polynomial time
$ 3.675
182
6
markgritter
steemstem
2018-08-20 20:48
The Computational Complexity of Some Logical Theories
I'm reading a book from 1979 by Jeanne Ferrante and Charles W. Rackoff: "The Computational Complexity of Logical Theories." Though it's now nearly 40 years old, it still gets cited often, so
$ 0.189
12
1
markgritter
steemstem
2018-08-03 05:54
This set of equations is a computer.
Hilbert's Tenth Problem from his famous list published in 1900, asks whether it is possible to create an algorithm which solves every Diophantine equation, that is, one whose solutions must be integers.
$ 6.914
192
4