Talk:14

Is it 8-bit bounded BF or not? in the TC proof. --Yayimhere2(school) (talk) 12:38, 21 August 2026 (UTC)

Seemingly it's unbounded values (but with bounded amount of cells). –PkmnQ (talk) 12:41, 21 August 2026 (UTC)

Yea ok. Then its three cell BF turing completeness --Yayimhere2(school) (talk) 12:55, 21 August 2026 (UTC)

Nested BF loops do not map to 14 properly:

BF:

       [.....[.....].....]
       |       ends here ^

14 (if / skips until the nearest \):

       /(..../(..../)\.../)\
       |   ends here ^

14 (if / skips until the matching \):

       /(..../(..../)\.../)\
       |          never ends ...>

So, the mapping table from BF to 14 and Turing completeness proof should be reworked. --Blashyrkh (talk) 21:56, 18 September 2026 (UTC)

I believe this is a proper mapping: [ -> (/ and ] -> )\. And it must be explicitly stated that / skips not until any \ but until matching \. Then it's Turing complete. --Blashyrkh (talk) 22:35, 18 September 2026 (UTC)

I'm actually kinda sensitive to swear words --Marcus 2n2 (talk) 12:29, 27 August 2026 (UTC)

Hows that relevant here? --Yayimhere2(school) (talk) 19:08, 27 August 2026 (UTC)

Would it be fine to remove the swear? --Marcus 2n2 (talk) 02:26, 3 September 2026 (UTC)

sure --dragoneater67 talk contribs (mobile) 02:47, 3 September 2026 (UTC)

Nested / and \?

Does / skip until the nearest \ or until the matching one? --Blashyrkh (talk) 18:02, 18 September 2026 (UTC)

I answered this question above, but it's not confirmed by the language's author. --Blashyrkh (talk) 22:35, 18 September 2026 (UTC)

Yeah (I'm the author) --the nit is typing... 04:47, 19 September 2026 (UTC)

Examples

I suggest to remove "Hello" example since a full-featured "Hello, world!" exists. Also, the A+B example should be considered cheating and replaced since the language has (i/o) as you accurately put. Anyway I'm going to implement full-featured A+B example during my golfing campaign. --Blashyrkh (talk) 21:43, 6 October 2026 (UTC)